On Graph Refutation for Relational Inclusions
Logic in Computer Science
2012-03-29 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1203.6159,
title = {On Graph Refutation for Relational Inclusions},
author = {Paulo A. S. Veloso and Sheila R. M. Veloso},
journal= {arXiv preprint arXiv:1203.6159},
year = {2012}
}
Comments
In Proceedings LSFA 2011, arXiv:1203.5423