Functional dependencies in relational databases: a lattice point of view
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Knowledge Spaces
Implementation of Relational Algebra Using Binary Decision Diagrams
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
RelView: an OBDD-based computer algebra system for relations
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Solving algorithmic problems on orders and lattices by relation algebra and RELVIEW
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Computations on simple games using RelView
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
| Hi-index | 0.00 |
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.