Title of article
A note on proofs with graphs
Author/Authors
Renata de Freitas، نويسنده , , Petrucio Viana، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2008
Pages
7
From page
129
To page
135
Abstract
Curtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197–216) presented a graphical calculus to prove inclusions between relations, leaving completeness of the system as an open question. Here we recast their system, excluding complementation and union, by presenting a low complexity decision algorithm to decide its valid inclusions. Completeness follows as a corollary.
Keywords
Relational calculus , graphs , Completeness , Decidability , Graphical reasoning
Journal title
Science of Computer Programming
Serial Year
2008
Journal title
Science of Computer Programming
Record number
1080041
Link To Document