Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA
lattices. We show that they can be generalized to arbitrary lattices. In the
case of iPred, this requires the identification of a join-semilattice
homomorphism into a distributive lattice.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices 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 Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-515226

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.