Abstract
Lattices are mathematical structures which are frequently used for the representation of data. Several authors have considered the problem of incremental construction of lattices. We show that with a rather general approach, this problem becomes well-structured. We give simple algorithms with satisfactory complexity bounds.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bernhard Ganter, Rudolf Wille: Formale Begriffsanalyse — Mathematische Grundlagen. Springer Verlag 1996.
C. Jard, G.-V. Jourdan and J.-X. Rampon: Computing On-Line the Lattice of Maximal Antichains of Posets. Order 11 (1994).
Martin Skorsky: Endliche Verbände — Diagramme und Eigenschaften. Shaker, 1992.
Petko Valtchev: An Algorithm for Minimal Insertion in a Type Lattice. Second International KRUSE Symposium, Vancouver, 1997.
Rudolf Wille: Finite distributive lattices as concept lattices. Atti Inc. Logica Mathematica, 2 (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganter, B., Kuznetsov, S.O. (1998). Stepwise construction of the Dedekind-MacNeille completion. In: Mugnier, ML., Chein, M. (eds) Conceptual Structures: Theory, Tools and Applications. ICCS 1998. Lecture Notes in Computer Science, vol 1453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054922
Download citation
DOI: https://doi.org/10.1007/BFb0054922
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64791-1
Online ISBN: 978-3-540-68673-6
eBook Packages: Springer Book Archive