Stone Relation Algebras
From MaRDI portal
Publication:5283207
DOI10.1007/978-3-319-57418-9_8zbMath1402.03099OpenAlexW2592285783MaRDI QIDQ5283207
Publication date: 21 July 2017
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Stone Relation Algebras ⋮ Verifying minimum spanning tree algorithms with Stone relation algebras ⋮ An algebraic framework for minimum spanning tree problems ⋮ Stone Algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relational style laws and constructs of linear algebra
- Internal axioms for domain semirings
- Axiomatizability of positive algebras of binary relations
- Relation algebras by games
- Algebras for iteration and infinite computations
- Relation algebras
- A completeness theorem for Kleene algebras and the algebra of regular events
- Relation-algebraic semantics
- Isabelle/HOL. A proof assistant for higher-order logic
- A new algebraic approach to L-fuzzy relations convenient to study crispness
- Lattices and ordered algebraic structures
- Dijkstra, Floyd and Warshall meet Kleene
- Categorical representation theorems of fuzzy relations
- Computing tournament solutions using relation algebra and RelView
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- A linear algebra approach to OLAP
- Graphs, dioids and semirings. New models and algorithms.
- L-fuzzy sets
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
- Relations among Matrices over a Semiring
- Regular Algebra Applied to Path-finding Problems
- Representations of ordered semigroups and lattices by binary relations
- Extending Sledgehammer with SMT Solvers
- Stone Relation Algebras
- Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
This page was built for publication: Stone Relation Algebras
