A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set

Details A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set

2011-11-15

arxiv.org/abs/1111.3975v2

Mathematics

Rings and Algebras

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-710121