| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 377051 | Artificial Intelligence | 2011 | 15 Pages |
Abstract
The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic CDC constraints is tractable, while reasoning with the CDC in general is NP-hard. This paper shows, however, that if some constraints are unspecified, then consistency checking of incomplete networks of basic CDC constraints is already intractable. This draws a sharp boundary between the tractable and intractable subclasses of the CDC. The result is achieved by a reduction from the well-known 3-SAT problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
