Relational characterisations of paths
DOI10.1016/j.jlamp.2020.100590zbMath1462.05198arXiv1801.04026OpenAlexW3073928042MaRDI QIDQ2210868
Peter Höfner, Hitoshi Furusawa, Walter Guttmann, Rudolf Berghammer
Publication date: 9 November 2020
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.04026
Paths and cycles (05C38) Mechanization of proofs and logical operations (03B35) Graph algorithms (graph-theoretic aspects) (05C85) Cylindric and polyadic algebras; relation algebras (03G15) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic approach to computations with progress
- Relation algebras by games
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Cardinality of relations with applications
- A sequent calculus for relation algebras
- Relation algebras
- Relational measures and integration in preference modeling
- Theory and applications of relational structures as knowledge instruments II. International workshops of COST Action 274, TARSKI, 2002--2005. Selected revised papers
- Relation algebras: Concept of points and representability
- Winskel is (almost) right: Towards a mechanized semantics textbook
- A completeness theorem for Kleene algebras and the algebra of regular events
- Calculating path algorithms
- A calculational approach to mathematical induction
- Theory and applications of relational structures as knowledge instruments. COST Action 274, TARSKI. Revised papers
- Isabelle/HOL. A proof assistant for higher-order logic
- Relational depth-first-search with applications
- An algebraic framework for minimum spanning tree problems
- Correspondence results for relational proof systems with application to the Lambek calculus
- Towards a refinement algebra
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Relational characterisations of paths
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Extending Sledgehammer with SMT solvers
- Translating higher-order clauses to first-order clauses
- System Description: E 1.8
- Relational Knowledge Discovery
- An Algebraic Calculus of Database Preferences
- Relational Concepts in Social Choice
- Algebraic Notions of Termination
- Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL
- Topological sorting of large networks
- Tool-Based Verification of a Relational Vertex Coloring Program
- On Automating the Calculus of Relations
- On Automated Program Construction and Verification
- Pair-Dense Relation Algebras
- Regular Algebra Applied to Path-finding Problems
- Boolean Algebra. A Correction
- Algebraic Investigation of Connected Components
- Automated Verification of Relational While-Programs
- On the Cardinality of Relations
- A Relational View of Recurrence and Attractors in State Transition Dynamics
- An axiomatic basis for computer programming
- Boolean Algebras with Operators
- On Kleene algebras
- Cardinality of relations and relational approximation algorithms
This page was built for publication: Relational characterisations of paths
