On Graph Refutation for Relational Inclusions
arXiv:1203.6159 · doi:10.4204/EPTCS.81.4
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.
In Proceedings LSFA 2011, arXiv:1203.5423