Computing and Visualizing Closure Objects Using Relation Algebra and RelView
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1953899 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- Computer Algebra in Scientific Computing
- Functional dependencies in relational databases: A lattice point of view
- Knowledge Spaces
- Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
Cited in
(6)- Contact, closure, topology, and the linking of row and column types of relations
- Column-wise extendible vector expressions and the relational computation of sets of sets
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
- Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView
This page was built for publication: Computing and Visualizing Closure Objects Using Relation Algebra and RelView
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644085)