Temporal representation and reasoning in artificial intelligence: Issues and approaches
Annals of Mathematics and Artificial Intelligence
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
Applied 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
Qualitative Spatial Representation and Reasoning: An Overview
Fundamenta Informaticae - Qualitative Spatial Reasoning
An Optimal Decision Procedure for Right Propositional Neighborhood Logic
Journal of Automated Reasoning
A new modal logic for reasoning about space: spatial propositional neighborhood logic
Annals of Mathematics and Artificial Intelligence
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
A new tractable subclass of the rectangle algebra
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hi-index | 0.00 |
The management of qualitative spatial information is an important research area in computer science and AI. Modal logic provides a natural framework for the formalization and implementation of qualitative spatial reasoning. Unfortunately, when directional relations are considered, modal logic systems for spatial reasoning usually turn out to be undecidable (often even not recursively enumerable). In this paper, we give a first example of a decidable modal logic for spatial reasoning with directional relations, called Weak Spatial Propositional Neighborhood Logic (WSpPNL for short). WSpPNL features two modalities, respectively an east modality and a north modality, to deal with non-empty rectangles over *** ×***. We first show the NEXPTIME-completeness of WSpPNL, then we develop an optimal tableau method for it.