On graph reasoning

In this paper, we study the (positive) graph relational calculus. The basis for this calculus was introduced by Curtis and Lowe in 1996 and some variants, motivated by their applications to semantics of programs and foundations of mathematics, appear scattered in the literature. No proper treatment of these ideas as a logical system seems to have been presented. Here, we give a formal presentation of the system, with precise formulation of syntax, semantics, and derivation rules. We show that the set of rules is sound and complete for the valid inclusions, and prove a finite model result as well as decidability. We also prove that the graph relational language has the same expressive power as a first-order positive fragment (both languages define the same binary relations), so our calculus may be regarded as a notational variant of the positive existential first-order logic of binary relations. The graph calculus, however, has a playful aspect, with rules easy to grasp and use. This opens a wide range of applications which we illustrate by applying our calculus to the positive relational calculus (whose set of valid inclusions is not finitely axiomatizable), obtaining an algorithm for deciding the valid inclusions and equalities of the latter.

[1]  Boris M. Schein,et al.  Relation algebras and function semigroups , 1970 .

[2]  R. Lyndon.  THE REPRESENTATION OF RELATIONAL ALGEBRAS , 1950 .

[3]  Hans-Jörg Kreowski,et al.  GRACE as a unifying approach to graph-transformation-based specification , 2001, Electron. Notes Theor. Comput. Sci..

[4]  C. J. Everett,et al.  The Representation of Relational Algebras. , 1951 .

[5]  Roger D. Maddux,et al.  The origin of relation algebras in the development and axiomatization of the calculus of relations , 1991, Stud Logica.

[6]  Willem P. de Roever,et al.  A Calculus for Recursive Program Schemes , 1972, ICALP.

[7]  Bjarni Jónsson,et al.  Representation of modular lattices and of relation algebras , 1959 .

[8]  R. Lyndon.  THE REPRESENTATION OF RELATION ALGEBRAS, II , 1956 .

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

[10]  Algebraic logic , 1985, Problem books in mathematics.

[11]  Daniel J. Dougherty,et al.  Normal Forms and Reduction for Theories of Binary Relations , 2000, RTA.

[12]  Paulo A. S. Veloso,et al.  Reasoning with Graphs , 2006, WoLLIC.

[13]  Andrea Formisano,et al.  A graphical approach to relational reasoning , 2001, Electron. Notes Theor. Comput. Sci..

[14]  Paulo A. S. Veloso,et al.  On a Graph Calculus for Algebras of Relations , 2008, WoLLIC.

[15]  Graham Hutton,et al.  Categories, allegories and circuit design , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[16]  J. Donald Monk.  Review: Alfred Tarski and Steven Givant, A formalization of set theory without variables , 1989 .

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

[18]  Claudio Gutiérrez,et al.  Normal forms for connectedness in categories , 2001, Ann. Pure Appl. Log..

[19]  Paulo A. S. Veloso,et al.  On Positive Relational Calculi , 2007, Log. J. IGPL.

[20]  Graham Hutton,et al.  A Relational Derivation of a Functional Program , 1992 .

[21]  Hajnal Andréka,et al.  Representations of distributive lattice-ordered semigroups with binary relations , 1991 .

[22]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[23]  Calogero G. Zarba,et al.  Compiling dyadic first-order specifications into map algebra , 2003, Theor. Comput. Sci..

[24]  Gavin Lowe,et al.  Proofs with Graphs , 1996, Sci. Comput. Program..

[25]  Andre Scedrov,et al.  Categories, allegories , 1990, North-Holland mathematical library.