Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10320337 | Artificial Intelligence | 2005 | 45 Pages |
Abstract
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a set of cardinal direction constraints. We introduce the first algorithm for this problem, prove its correctness and analyze its computational complexity. Utilizing the above algorithm, we prove that the consistency checking of a set of basic (i.e., non-disjunctive) cardinal direction constraints can be performed in O(n5) time. We also show that the consistency checking of a set of unrestricted (i.e., disjunctive and non-disjunctive) cardinal direction constraints is NP-complete. Finally, we briefly discuss an extension to the basic model and outline an algorithm for the consistency checking problem of this extension.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Spiros Skiadopoulos, Manolis Koubarakis,