Skip to main content
Conference Proceedings

The basic theorem on preconcept lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3874 LNAI 80-88
DOI: 10.1007/11671404_5
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Preconcept Lattices are identified to be (up to isomorphism) the completely distributive complete lattices in which the supremum of all atoms is equal or greater than the infimum of all coatoms. This is a consequence of the Basic Theorem on Preconcept Lattices, which also offers means for checking line diagrams of preconcept lattices. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Burgmann, C., & Wille, R. (2006). The basic theorem on preconcept lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3874 LNAI, pp. 80–88). https://doi.org/10.1007/11671404_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free