Stepwise construction of the Dedekind-MacNeille completion
B. Ganter, und S. Kuznetsov. Conceptual Structures: Theory, Tools and Applications, Volume 1453 von Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, (1998)
DOI: 10.1007/BFb0054922
Zusammenfassung
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.
%0 Book Section
%1 ganter1998stepwise
%A Ganter, Bernhard
%A Kuznetsov, Sergei
%B Conceptual Structures: Theory, Tools and Applications
%C Berlin/Heidelberg
%D 1998
%E Mugnier, Marie-Laure
%E Chein, Michel
%I Springer
%K algebra completion lattice math
%P 295--302
%R 10.1007/BFb0054922
%T Stepwise construction of the Dedekind-MacNeille completion
%U http://dx.doi.org/10.1007/BFb0054922
%V 1453
%X 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.
%@ 978-3-540-64791-1
@incollection{ganter1998stepwise,
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.},
added-at = {2011-12-01T13:54:50.000+0100},
address = {Berlin/Heidelberg},
author = {Ganter, Bernhard and Kuznetsov, Sergei},
biburl = {https://www.bibsonomy.org/bibtex/20c986e520647b86c202633cc6945d524/jaeschke},
booktitle = {Conceptual Structures: Theory, Tools and Applications},
doi = {10.1007/BFb0054922},
editor = {Mugnier, Marie-Laure and Chein, Michel},
interhash = {6ab4d800575b90bf787ade575b38994b},
intrahash = {0c986e520647b86c202633cc6945d524},
isbn = {978-3-540-64791-1},
keywords = {algebra completion lattice math},
pages = {295--302},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2014-07-28T15:57:31.000+0200},
title = {Stepwise construction of the Dedekind-MacNeille completion},
url = {http://dx.doi.org/10.1007/BFb0054922},
volume = 1453,
year = 1998
}