Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Relations algebras in qualitative spatial reasoning
Fundamenta Informaticae
Boolean connection algebras: a new approach to the Region-Connection Calculus
Artificial Intelligence
A relation — algebraic approach to the region connection calculus
Theoretical Computer Science
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
Contact Algebras and Region-based Theory of Space: A Proximity Approach - I
Fundamenta Informaticae
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Hi-index | 0.00 |
Splitting atoms in a relation algebra is a common tool to generate new algebras from old ones. This includes constructing nonrepresentable algebras from representable structures. The known method of splitting atoms does not allow that bijections different from the identity are contained in the starting algebra. This is a major drawback of that method because interesting candidates in mereotopology do contain such bijections. An ad-hoc splitting was done in those examples, and the results have been published in several papers. With this paper we want to start a thorough investigation of possible splitting methods.