On Graph Refutation for Relational Inclusions

Autor:	Veloso, Paulo A. S., Veloso, Sheila R. M.
Rok vydání:	2012
Předmět:	Computer Science - Logic in Computer Science
Zdroj:	EPTCS 81, 2012, pp. 47-62
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.81.4
Popis:	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. Comment: In Proceedings LSFA 2011, arXiv:1203.5423
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1203.6159 Zobrazit plný text záznamu View this record from Arxiv