Computer Science – Logic in Computer Science
Scientific paper
2012-03-28
EPTCS 81, 2012, pp. 47-62
Computer Science
Logic in Computer Science
In Proceedings LSFA 2011, arXiv:1203.5423
Scientific paper
10.4204/EPTCS.81.4
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.
Veloso Paulo A. S.
Veloso Sheila R. M.
No associations
LandOfFree
On Graph Refutation for Relational Inclusions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Graph Refutation for Relational Inclusions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Graph Refutation for Relational Inclusions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-271836