On Graph Refutation for Relational Inclusions
classification
💻 cs.LO
keywords
relationalcalculusestablishinggraphinclusionsrefutationcompleteconceptually
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.