Computation of Cut Completions and Concept Lattices Using
Relational Algebra and RelView
R. Berghammer
Several relation-algebraic algorithms for computing the cut completion
of a partially ordered set are formally developed and afterwards
generalized to the case of concept lattices. It is shown how the
algorithms can be translated into the programming language of RelView
and executed using this system. Furthermore, it is demonstrated how to
obtain and draw Hasse diagrams of concept lattices as labeled directed
graphs using the RelView system.