An incremental algorithm to construct a lattice of set intersections

Autor:	Dean van der Merwe, Sergei Obiedkov, Bruce W. Watson, Derrick G. Kourie
Rok vydání:	2009
Předmět:	Closure system Correctness by construction Ramer–Douglas–Peucker algorithm Computer science Lattice (order) Incremental algorithm Lattice reduction Algorithm Concept lattice Software
Zdroj:	Science of Computer Programming. 74(3):128-142
ISSN:	0167-6423
DOI:	10.1016/j.scico.2008.09.015
Popis:	An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection of sets with respect to set intersection. The analysis explains the empirical efficiency of the related concept lattice construction algorithm that had been observed in previous studies. The derivation highlights the effectiveness of a correctness-by-construction approach to algorithm development.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea57ed46c24a65b95426b59325abc853 Zobrazit plný text záznamu Full Text from ScienceDirect