Computing and Visualizing Closure Objects Using Relation Algebra and RelView

DOI10.1007/978-3-642-04103-7_3zbMath1260.68477OpenAlexW1565143646MaRDI QIDQ3644085

Rudolf Berghammer, Bernd Braßel

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_3

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complete lattices, completions (06B23) Cylindric and polyadic algebras; relation algebras (03G15) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool ⋮ Contact, closure, topology, and the linking of row and column types of relations

Uses Software

• RelView

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional dependencies in relational databases: A lattice point of view
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
• Knowledge Spaces
• Computer Algebra in Scientific Computing

This page was built for publication: Computing and Visualizing Closure Objects Using Relation Algebra and RelView