Beyond Consistency and Substitutability - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Beyond Consistency and Substitutability


Elimination of inconsistent values in instances of the constraint satisfaction problem (CSP) conserves all solutions. Elimination of substitutable values conserves at least one solution. We show that certain values which are neither inconsistent nor substitutable can also be deleted while conserving at least one solution. This allows us to state novel rules for the elimination of values in binary CSP. From a practical point of view, we show that one such rule can be applied in the same asymptotic time complexity as neighbourhood substitution but is strictly stronger. An alternative to the elimination of values from domains is the elimination of variables. We give novel satisfiability-preserving variable elimination operations. In each case we show that if the instance is satisfiable, then a solution to the original instance can always be recovered in low-order polynomial time from a solution to the reduced instance.
Fichier principal
Vignette du fichier
Cooper_13076.pdf (475.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01141435 , version 1 (13-04-2015)


  • HAL Id : hal-01141435 , version 1
  • OATAO : 13076


Martin Cooper. Beyond Consistency and Substitutability. International Conference on Principles and Practice of Constraint Programming - CP 2014, Sep 2014, Lyon, France. pp. 256-271. ⟨hal-01141435⟩
64 View
94 Download


Gmail Facebook Twitter LinkedIn More