Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334731 | Theoretical Computer Science | 2005 | 15 Pages |
Abstract
We prove a representation theorem for Boolean contact algebras which implies that the axioms for the region connection calculus (RCC) [D.A. Randell, A.G. Cohn, Z. Cui, Computing transitivity tables: a challenge for automated theorem provers, in: D. Kapur (Ed.), Proceedings of the 11th international conference on Automated Deduction (CADE-11), Lecture Notes in Artificial Intelligence, Vol. 607, Springer, Saratoga, Springs, NY, 1992, pp. 786-790] are complete for the class of subalgebras of the algebras of regular closed sets of weakly regular connected T1 spaces.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ivo Düntsch, Michael Winter,