Journal of the ACM (JACM)
The lattice of varieties of representable relation algebras
Journal of Symbolic Logic
Maintaining knowledge about temporal intervals
Communications of the ACM
A relation — algebraic approach to the region connection calculus
Theoretical Computer Science
Imprecision in Finite Resolution Spatial Data
Geoinformatica
Computing Transivity Tables: A Challenge For Automated Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Computer-aided investigations of relation algebras
Computer-aided investigations of relation algebras
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Qualitative reasoning in electronic fault diagnosis
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Toward a geometry of common sense: a semantics and a complete axiomatization of mereotopology
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Fundamenta Informaticae
Hi-index | 0.00 |
The formalization of the “part - of” relationship goes back to the mereology of S. Leśniewski, subsequently taken up by Leonard & Goodman (1940), and Clarke (1981). In this paper we investigate relation algebras obtained from different notions of “part-of”, respectively, “connectedness” in various domains. We obtain minimal models for the relational part of mereology in a general setting, and when the underlying set is an atomless Boolean algebra.