Computational Properties of Qualitative Spatial Reasoning: First Results
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
A representation theorem for Boolean contact algebras
Theoretical Computer Science
On the Computational Complexity of Spatial Logics with Connectedness Constraints
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
On the decidability of connectedness constraints in 2D and 3D Euclidean spaces
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Modal Logics for Region-based Theories of Space
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Contact Algebras and Region-based Theory of Space: A Proximity Approach - I
Fundamenta Informaticae
Contact Algebras and Region-based Theory of Space: Proximity Approach - II
Fundamenta Informaticae
Hi-index | 0.00 |
We consider the quantifier-free languages, Bc and Bc°, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of Rn (n ≥ 2) and, additionally, over the regular closed semilinear sets of Rn. The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1, and that the satisfiability problem for Bc and Bc° is undecidable over both the regular closed sets and the regular closed semilinear sets in the Euclidean plane. However, we also prove that the satisfiability problem for Bc° is NP-complete over the regular closed sets in all dimensions greater than 2, while the corresponding problem for the regular closed semilinear sets is ExpTime-complete. Our results show, in particular, that spatial reasoning is much harder over Euclidean spaces than over arbitrary topological spaces.