Stepwise construction of the Dedekind-MacNeille completion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1453, Issue , 1998, Pages 295-302

  Ganter, Bernhard ^a   Kuznetsov, Sergei O ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b All Russian Institute for Scientific and Technical Information   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY BOUNDS; INCREMENTAL CONSTRUCTION; MATHEMATICAL STRUCTURE; SIMPLE ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 84957662835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054922     Document Type: Conference Paper

References (5)

1. Bernhard Ganter, Rudolf Wille: Formale Begriffsanalyse - Mathematische Grundlagen. Springer Verlag 1996.
2. C. Jard, G.-V. Jourdan and J.-X. Rampon: Computing On-Line the Lattice of Maximal Antichains of Posets. Order 11 (1994).
3. Martin Skorsky: Endliche Verbände - Diagramme und Eigenschaften. Shaker, 1992.
4. Petko Valtchev: An Algorithm for Minimal Insertion in a Type Lattice. Second International KRUSE Symposium, Vancouver, 1997.
5. Rudolf Wille: Finite distributive lattices as concept lattices. Atti Inc. Logica Math-ematica, 2 (1985).