A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set
Rings and Algebras
2012-01-19 v2
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.
Cite
@article{arxiv.1111.3975,
title = {A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set},
author = {Daniel Borchmann},
journal= {arXiv preprint arXiv:1111.3975},
year = {2012}
}