Reasoning with Graphs

In this paper we study the (positive) graph relational calculus. The basis for this calculus was introduced by S. Curtis and G. 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 easier 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]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

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

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

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

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

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

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

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

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

[10]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

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

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

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

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

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

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

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