Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Closure properties of constraints
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Combining topological and size information for spatial reasoning
Artificial Intelligence
Qualitative representation of spatial knowledge in two-dimensional space
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
COSIT '99 Proceedings of the International Conference on Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science
Computational Properties of Qualitative Spatial Reasoning: First Results
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
On Topological Consistency and Realization
Constraints
Automatic generation of tourist maps
ACM SIGGRAPH 2008 papers
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence
Combining topological and directional information for spatial reasoning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
RCC8 binary constraint network can be consistently extended
Artificial Intelligence
A divide-and-conquer approach for solving interval algebra networks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Combining RCC-8 with qualitative direction calculi: algorithms and complexity
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On combinations of binary qualitative constraint calculi
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Including landmarks in routing instructions
Journal of Location Based Services
Reasoning about cardinal directions between extended objects
Artificial Intelligence
Qualitative reasoning with directional relations
Artificial Intelligence
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Solving qualitative constraints involving landmarks
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Reasoning about cardinal directions between extended objects: The NP-hardness result
Artificial Intelligence
Reasoning With Topological And Directional Spatial Information
Computational Intelligence
Hi-index | 0.00 |
Dealing with spatial and temporal knowledge is an indispensable part of almost all aspects of human activity. The qualitative approach to spatial and temporal reasoning, known as Qualitative Spatial and Temporal Reasoning (QSTR), typically represents spatial/temporal knowledge in terms of qualitative relations (e.g., to the east of, after), and reasons with spatial/temporal knowledge by solving qualitative constraints. When formulating qualitative constraint satisfaction problems (CSPs), it is usually assumed that each variable could be ''here, there and everywhere''. Practical applications such as urban planning, however, often require a variable to take its value from a certain finite domain, i.e. it is required to be 'here or there, but not everywhere'. Entities in such a finite domain often act as reference objects and are called ''landmarks'' in this paper. The paper extends the classical framework of qualitative CSPs by allowing variables to take values from finite domains. The computational complexity of the consistency problem in this extended framework is examined for the five most important qualitative calculi, viz. Point Algebra, Interval Algebra, Cardinal Relation Algebra, RCC5, and RCC8. We show that all these consistency problems remain in NP and provide, under practical assumptions, efficient algorithms for solving basic constraints involving landmarks for all these calculi.