Syntactically characterizing local-to-global consistency in ORD-Horn

  • Authors:

  • Michał Wrona

  • Affiliations:

  • Department of Computer and Information Science, Linköpings universitet, Linköping, Sweden

  • Venue:
  • CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is globally consistent if it is completely explicit, that is, every partial solution may be extended to a full solution by greedily assigning values to variables one at a time. We will say that a structure B has local-to-global consistency if establishing local-consistency yields a globally consistent instance of $\textbf{CSP}(\mathbf{B})$. This paper studies local-to-global consistency for ORD-Horn languages, that is, structures definable over the ordered rationals (ℚ;