Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Artificial Intelligence
2010-12-06 v1 Machine Learning
Logic
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.
Keywords
Cite
@article{arxiv.1012.0742,
title = {Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices},
author = {José L. Balcázar and Cristina Tîrnăucă},
journal= {arXiv preprint arXiv:1012.0742},
year = {2010}
}