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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have