Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions

  • Authors:
  • Spiros Skiadopoulos;Manolis Koubarakis

  • Affiliations:
  • -;-

  • Venue:
  • CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present a formal model for qualitative spatial reasoning with cardinal directions and study the problem of checking the consistency of a set of cardinal direction constraints. We present 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 cardinal direction constraints can be performed in O(n5) time while the consistency checking of an unrestricted set of cardinal direction constraints is NP-complete. Finally, we briefly discuss some extensions to the basic model.