Boolean connection algebras: a new approach to the Region-Connection Calculus
Artificial Intelligence
A note on proximity spaces and connection based mereology
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Computing Transivity Tables: A Challenge For Automated Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Relation Algebras and their Application in Temporal and Spatial Reasoning
Artificial Intelligence Review
A representation theorem for Boolean contact algebras
Theoretical Computer Science
Rough Set Theory from a Math-Assistant Perspective
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
The lattice of contact relations on a Boolean algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Hi-index | 0.00 |
We consider Boolean algebras endowed with a contact relation which are abstractions of Boolean algebras of regular closed sets together with Whitehead's connection relation [17], in which two non-empty regular closed sets are connected if they have a non-empty intersection. These are standard examples for structures used in qualitative reasoning, mereotopology, and proximity theory. We exhibit various methods how such algebras can be constructed and give several non-standard examples, the most striking one being a countable model of the Region Connection Calculus in which every proper region has infinitely many holes.