A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set
classification
🧮 math.RA
keywords
algorithmnext-closureapplycomputationcontextcorrectnesselementsenumerating
read the original abstract
We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.