From local to global consistency
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
A Generic Toolkit for n-ary Qualitative Temporal and Spatial Calculi
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Qualitative Reasoning about Convex Relations
Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Qualitative spatial representation and reasoning in the SparQ-toolbox
SC'06 Proceedings of the 2006 international conference on Spatial Cognition V: reasoning, action, interaction
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
Hi-index | 0.00 |
In the area of qualitative spatial reasoning, the LR calculus (a refinement of Ligozat's flip-flop calculus) is a quite simple constraint calculus that forms the core of several orientation calculi like the Dipole calculi and the OPRA1 calculus by introducing the left-right-dichotomy. For many qualitative spatial calculi, algebraic closure is applied as the standard polynomial time “decision” procedure. For a long time it was believed that this can decide the consistency of scenarios of the LR calculus. However, in [8] it was shown that algebraic closure is a bad approximation of consistency for LR scenarios: scenarios in the base relations “Left” and “Right” are always algebraically closed, no matter if those scenarios are consistent or not. So algebraic closure is completely useless here. Furthermore, in [15] it was proved that the consistency problem for any calculus with relative orientation containing the relations “Left” and “Right” is NP-hard. In this paper we propose a new and better polynomial time approximation procedure for this NP-hard problem. It is based on the angles of triangles in the Euclidean plane. LR scenarios are translated to sets of linear inequalities over the real numbers. We evaluate the quality of this procedure by comparing it bot to the old approximation using algebraic closure and to the (exact but exponential time) Buchberger algorithm for Gröbner bases (used as a decision method).