Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
classification
💻 cs.AI
cs.LGmath.LO
keywords
latticesalgorithmarbitraryborderdiagramshasseipredalgorithms
read the original abstract
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.
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.