Paper Info
Title
Computing and Visualizing Closure Objects Using Relation Algebra and RelView
Abstract
Closure systems and closure operations play an important role in both mathematics and computer science. In addition there are a number of concepts which have been proven to be isomorphic to closure systems and we refer to all such concepts as closure objects . In this work we develop relation-algebraic specifications to recognize several classes of closure objects, compute the complete lattices they constitute and transform any of these closure objects into another. All specifications are algorithmic and can directly be translated into the programming language of the computer algebra system RelView , which is a special purpose tool for computing with relations. We show that the system is well suited for computing and visualizing closure objects and their complete lattices.
Year
DOI
Venue
2009
10.1007/978-3-642-04103-7_3
CASC
Keywords
Field
DocType
closure object,complete lattice,important role,closure operation,closure system,programming language,relation algebra,computer science,computer algebra system relview,visualizing closure object,visualizing closure,relation-algebraic specification,closure operator
Dependency relation,Discrete mathematics,Algebra,Lattice (order),Closure operator,Computer science,Symbolic computation,Isomorphism,Complete lattice,Relation algebra
Conference
Volume
ISSN
Citations 
5743
0302-9743
3
PageRank 
References 
Authors
0.45
8
2
Name
Order
Citations
PageRank
Rudolf Berghammer156976.48
Bernd Braßel218112.47