Finding all closed sets: A general approach. (English) Zbl 0754.06003

We present a unifying theoretical and algorithmic approach to the problems of determining all closed sets of a closure operator, doing this up to isomorphism, and determining the elements of certain ideals of a power set. This will be done by generalizing the concept of closure operators using the interplay of several orders of a power set.
Reviewer: K.Reuter


06A15 Galois correspondences, closure operators (in relation to ordered sets)
68R99 Discrete mathematics in relation to computer science
Full Text: DOI


[1] B.Ganter (1987) Algorithmen zur formalen Begriffsanalyse, in B.Ganter, R.Wille, and K. E.Wolff, eds, Beitr?ge zur Begriffsanalyse, p. 241-254, B.I.-Wissenschaftsverlag, Mannheim, Wien, Z?rich.
[2] B. Ganter, Finding closed sets under symmetry, Preprint. · Zbl 0754.06003
[3] C.Read (1987) Every one a winner, or, how to avoid isomorphism search when cataloguing combinatorial configurations, Annals of Discr. Math. 2, 107-120. · Zbl 0392.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.