| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435842 | Science of Computer Programming | 2008 | 7 Pages |
Abstract
Curtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197–216) presented a graphical calculus to prove inclusions between relations, leaving completeness of the system as an open question. Here we recast their system, excluding complementation and union, by presenting a low complexity decision algorithm to decide its valid inclusions. Completeness follows as a corollary.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
