Results 1 -
2 of
2
Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView
, 2004
"... 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 syste ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
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.
Considering Design Tasks in OO-Software Engineering using Relations and Relation-based Tools
"... Abstract. We demonstrate how relational algebra and its mechanization through the object-oriented Java-library Kure, which is based on the software system RelView, can be used to approach practical problems in the design of object-oriented software. The examples we present range from the search of i ..."
Abstract
- Add to MetaCart
Abstract. We demonstrate how relational algebra and its mechanization through the object-oriented Java-library Kure, which is based on the software system RelView, can be used to approach practical problems in the design of object-oriented software. The examples we present range from the search of improper code pieces and 3D graphical software design through to the detection of code parts that show design pattern structure. 1
