The RELVIEW-System

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.

• Type: Conference
• Year: 1991
• Where: STACS
• Authors: Rudolf Berghammer, Gunther Schmidt
• Keywords: Concept Lattices, Partially Ordered Set, Several Relation-algebraic Algorithms, STACS 1991, Theoretical Computer Science