Reasoning with Graphs

Authors:
Renata P. de Freitas;Paulo A. S. Veloso;Sheila R. M. Veloso;Petrucio Viana
Affiliations:
Institute of Mathematics, UFF, Niterói, Brazil and Systems and Computer Engineering Program, COPPE/UFRJ, Rio de Janeiro, Brazil and Systems and Computer Engin. Dept., Faculty of Engineering, ...;Institute of Mathematics, UFF, Niterói, Brazil and Systems and Computer Engineering Program, COPPE/UFRJ, Rio de Janeiro, Brazil and Systems and Computer Engin. Dept., Faculty of Engineering, ...;Institute of Mathematics, UFF, Niterói, Brazil and Systems and Computer Engineering Program, COPPE/UFRJ, Rio de Janeiro, Brazil and Systems and Computer Engin. Dept., Faculty of Engineering, ...;Institute of Mathematics, UFF, Niterói, Brazil and Systems and Computer Engineering Program, COPPE/UFRJ, Rio de Janeiro, Brazil and Systems and Computer Engin. Dept., Faculty of Engineering, ...
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 4
Cited 4

Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Proofs with graphs

Science of Computer Programming - Special issue on mathematics of program construction
Compiling dyadic first-order specifications into map algebra

Theoretical Computer Science - Algebraic methods in language processing
Normal Forms and Reduction for Theories of Binary Relations

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications

On a Graph Calculus for Algebras of Relations

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A note on proofs with graphs

Science of Computer Programming
Positive Fork Graph Calculus

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On graph reasoning

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.