| Autor: |
Paulo A. S. Veloso, Sheila R. M. Veloso |
| Jazyk: |
angličtina |
| Rok vydání: |
2012 |
| Předmět: |
|
| Zdroj: |
Electronic Proceedings in Theoretical Computer Science, Vol 81, Iss Proc. LSFA 2011, Pp 47-62 (2012) |
| Druh dokumentu: |
article |
| ISSN: |
2075-2180 |
| 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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
