Decidable relationships between consistency notions for constraint satisfaction problems

  • Authors:

  • Albert Atserias;Mark Weyer

  • Affiliations:

  • Universitat Politècnica de Catalunya, Barcelona, Spain;Humboldt Universität zu Berlin, Berlin, Germany

  • Venue:
  • CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-consistency, (j, k)-consistency, k-consistency, k-minimality, and refinements of arc-consistency such as peek arc-consistency and singleton arc-consistency. Our main result is that for any two instances of the abstract pebble game where the first satisfies the additional condition of being stacked, there exists an algorithm to decide whether consistency with respect to the first implies consistency with respect to the second. In particular, there is a decidable criterion to tell whether singleton arc-consistency with respect to a given constraint language implies k-consistency with respect to the same constraint language, for any fixed k. We also offer a new decidable criterion to tell whether arc-consistency implies satisfiability which pulls from methods in Ramsey theory and looks more amenable to generalization.