On Graph Refutation for Relational Inclusions

Paulo A. S. Veloso
(COPPE-UFRJ, Brazil)
Sheila R. M. Veloso
(FEN-UERJ, Brazil)

We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually simpler and easier to use than the usual ones.

In Simona Ronchi della Rocca and Elaine Pimentel: Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2011), Belo Horizonte, Brazil, 27 August 2011, Electronic Proceedings in Theoretical Computer Science 81, pp. 47–62.
Published: 24th March 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.81.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org