Relational Characterisations of Paths

Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in many areas of mathematics and computing, researchers usually fall back to point-wise reasoning when it comes to arguments about paths in a graph. We present a purely algebraic way to specify different kinds of paths in relation algebras. We study the relationship between paths with a designated root vertex and paths without such a vertex. Since we stay in first-order logic this development helps with mechanising proofs. To demonstrate the applicability of the algebraic framework we verify the correctness of three basic graph algorithms. All results of this paper are formally verified using Isabelle/HOL.

[1]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[2]  I. Hodkinson,et al.  Relation Algebras by Games , 2002 .

[3]  Tobias Nipkow,et al.  Winskel is (almost) Right: Towards a Mechanized Semantics Textbook , 1996, Formal Aspects of Computing.

[4]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[5]  Gunther Schmidt,et al.  Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.

[6]  Ewa Orlowska,et al.  Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus , 2002, Stud Logica.

[7]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[8]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[9]  Roland Glück.  Algebraic Investigation of Connected Components , 2017, RAMiCS.

[10]  Kan Ching Ng,et al.  Relation algebras with transitive closure , 1984 .

[11]  Roger D. Maddux,et al.  Some sufficient conditions for the representability of relation algebras , 1978 .

[12]  Dexter Kozen,et al.  A completeness theorem for Kleene algebras and the algebra of regular events , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[13]  Roger D. Maddux,et al.  Relation Algebras , 1997, Relational Methods in Computer Science.

[14]  Gunther Schmidt,et al.  Relational measures and integration in preference modeling , 2008, J. Log. Algebraic Methods Program..

[15]  Sinisa Crvenkovic,et al.  On Kleene Algebras , 1993, Theor. Comput. Sci..

[16]  Walter Guttmann,et al.  Verifying minimum spanning tree algorithms with Stone relation algebras , 2018, J. Log. Algebraic Methods Program..

[17]  Rudolf Berghammer,et al.  Automated Verification of Relational While-Programs , 2014, RAMICS.

[18]  Sebastian Fischer,et al.  Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures , 2015, J. Log. Algebraic Methods Program..

[19]  Walter Guttmann,et al.  Stone-Kleene Relation Algebras , 2017, Arch. Formal Proofs.

[20]  M. E. Müller.  Relational Knowledge Discovery , 2012 .

[21]  Marc Roubens,et al.  Theory and Applications of Relational Structures as Knowledge Instruments II, International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers , 2006, Theory and Applications of Relational Structures as Knowledge Instruments.

[22]  Rudolf Berghammer,et al.  Cardinality of relations and relational approximation algorithms , 2016, J. Log. Algebraic Methods Program..

[23]  T. Nipkow.  Hoare Logics in Isabelle/HOL , 2002 .

[24]  Lawrence C. Paulson,et al.  Translating Higher-Order Clauses to First-Order Clauses , 2007, Journal of Automated Reasoning.

[25]  A. P. Bowran.  A Boolean Algebra , 1965 .

[26]  E. V. Huntington.  Boolean Algebra. A Correction , 1933 .

[27]  E. V. Huntington.  Sets of independent postulates for the algebra of logic , 1904 .

[28]  Rudolf Berghammer.  Combining Relational Calculus and the Dijkstra-Gries Method for Deriving Relational Programs , 1999, Inf. Sci..

[29]  Vincenzo Manca,et al.  A Relational View of Recurrence and Attractors in State Transition Dynamics , 2006, RelMiCS.

[30]  Walter Guttmann,et al.  An algebraic framework for minimum spanning tree problems , 2018, Theor. Comput. Sci..

[31]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[32]  J. Conway.  Regular algebra and finite machines , 1971 .

[33]  Gunther Schmidt,et al.  Relation algebras: Concept of points and representability , 1985, Discret. Math..

[34]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[35]  Georg Struth,et al.  Relation Algebra , 2014, Arch. Formal Proofs.

[36]  Goftfried Tinhofer.  Methoden der angewandten Graphentheorie , 1976 .

[37]  Yasuo Kawahara.  On the Cardinality of Relations , 2006, RelMiCS.

[38]  Han-Hing Dang,et al.  First-Order Theorem Prover Evaluation w . r . t . Relation-and Kleene Algebra , 2013 .

[39]  Rudolf Berghammer,et al.  Tool-Based Verification of a Relational Vertex Coloring Program , 2015, RAMICS.

[40]  Simon Foster,et al.  Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL - (Invited Tutorial) , 2011, RAMiCS.

[41]  E. V. Huntington.  A New Set of Independent Postulates for the Algebra of Logic with Special Reference to Whitehead and Russell's Principia Mathematica. , 1932, Proceedings of the National Academy of Sciences of the United States of America.

[42]  Joakim von Wright,et al.  Towards a refinement algebra , 2004, Sci. Comput. Program..

[43]  Bernhard Möller,et al.  An Algebraic Calculus of Database Preferences , 2012, MPC.

[44]  Walter Guttmann,et al.  Stone Relation Algebras , 2017, RAMiCS.

[45]  Roland C. Backhouse,et al.  Calculating Path Algorithms , 1994, Sci. Comput. Program..

[46]  Walter Guttmann,et al.  An algebraic approach to computations with progress , 2016, J. Log. Algebraic Methods Program..

[47]  Georg Struth,et al.  Algebraic Notions of Termination , 2010, Log. Methods Comput. Sci..

[48]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[49]  Gunther Schmidt.  Relational Concepts in Social Choice , 2012, RAMICS.

[50]  E. V. Huntington.  Boolean algebra. A correction to: “New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell’s Principia mathematica” [Trans. Amer. Math. Soc. 35 (1933), no. 1, 274–304; 1501684] , 1933 .

[51]  A. B. Kahn,et al.  Topological sorting of large networks , 1962, CACM.

[52]  Yasuo Kawahara,et al.  Relational Aspects of Relational Database Dependencies , 2000, RelMiCS.

[53]  Roland Carl Backhouse,et al.  A Calculational Approach to Mathematical Induction , 1997, Theor. Comput. Sci..

[54]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[55]  Markus Wenzel,et al.  Isabelle, Isar - a versatile environment for human readable formal proof documents , 2002 .

[56]  Markus Wenzel,et al.  Isar - A Generic Interpretative Approach to Readable Formal Proof Documents , 1999, TPHOLs.

[57]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[58]  Georg Struth,et al.  On Automating the Calculus of Relations , 2008, IJCAR.

[59]  Rudolf Berghammer,et al.  Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs , 2001, RelMiCS.

[60]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[61]  Roger D. Maddux,et al.  A sequent calculus for relation algebras , 1983, Ann. Pure Appl. Log..

[62]  Bernhard Möller,et al.  Modal Knowledge and Game Semirings , 2013, Comput. J..

[63]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[64]  Walter Guttmann,et al.  Relation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm , 2016, ICTAC.

[65]  Damien Pous,et al.  Automata for relation algebra and formal proofs , 2016 .

[66]  Georg Struth,et al.  On Automated Program Construction and Verification , 2010, MPC.

[67]  R. Maddux.  Pair-dense relation algebras , 1991 .

[68]  Andreas Wolf,et al.  Relation-Algebraic Derivation of Spanning Tree Algorithms , 1998, MPC.

[69]  Nikita Danilenko,et al.  Cardinality of relations with applications , 2016, Discret. Math..

[70]  R. Backhouse,et al.  Regular Algebra Applied to Path-finding Problems , 1975 .

[71]  Gunther Schmidt,et al.  Relational Mathematics , 2010, Encyclopedia of Mathematics and its Applications.

[72]  Fred B. Schneider,et al.  A Theory of Graphs , 1993 .

[73]  Lawrence C. Paulson,et al.  Extending Sledgehammer with SMT Solvers , 2011, CADE.

[74]  Rudolf Berghammer,et al.  Relational depth-first-search with applications , 2001, Inf. Sci..