Results 1 
7 of
7
Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView
, 2004
"... Several relationalgebraic 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 relationalgebraic 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.
Solving Design Problems in OOSoftware Engineering With Relations and RelView
"... We demonstrate how relational algebra and its mechanization through the software system RelView can be used for solving practical problems in the design of objectoriented software. The examples we present range from the search of improper code pieces to the detection of code parts indicating some ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We demonstrate how relational algebra and its mechanization through the software system RelView can be used for solving practical problems in the design of objectoriented software. The examples we present range from the search of improper code pieces to the detection of code parts indicating some design pattern structure.
Considering Design Tasks in OOSoftware Engineering using Relations and Relationbased Tools
"... Abstract. We demonstrate how relational algebra and its mechanization through the objectoriented Javalibrary Kure, which is based on the software system RelView, can be used to approach practical problems in the design of objectoriented software. The examples we present range from the search of i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We demonstrate how relational algebra and its mechanization through the objectoriented Javalibrary Kure, which is based on the software system RelView, can be used to approach practical problems in the design of objectoriented 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
Serveur Web: www.gate.cnrs.frApplying Relation Algebra and RelView to Measures in a Social Network ⋆
"... Abstract. We present an application of relation algebra to measure players ’ ‘strength ’ in a social network with influence between players. In particular, we deal with power, success, and influence of a player as measured by the HoedeBakker index, its generalization and modifications, and by the i ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present an application of relation algebra to measure players ’ ‘strength ’ in a social network with influence between players. In particular, we deal with power, success, and influence of a player as measured by the HoedeBakker index, its generalization and modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influence function. This leads to specifications, which can be executed with the help of the BDDbased tool RelView after a simple translation into the tool’s programming language. As an example
Algebraic Visualization of Relations Using RelView
"... Abstract. For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. This means rearranging the matrix appropriately, permuting rows and columns simultaneously or independently as ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. This means rearranging the matrix appropriately, permuting rows and columns simultaneously or independently as required. In this way, many complex situations may successfully be handled in various application fields. We show how relation algebra and RelView can be combined to solve such tasks. 1