Skip to Main content Skip to Navigation
Journal articles

New schemes for simplifying binary constraint satisfaction problems

Abstract : Finding a solution to a Constraint Satisfaction Problem (CSP) is known to be an NP-hard task. This has motivated the multitude of works that have been devoted to developing techniques that simplify CSP instances before or during their resolution. The present work proposes rigidly enforced schemes for simplifying binary CSPs that allow the narrowing of value domains, either via value merging or via value suppression. The proposed schemes can be viewed as parametrized generalizations of two widely studied CSP simplification techniques, namely, value merging and neighbourhood substitutability. Besides, we show that both schemes may be strengthened in order to allow variable elimination, which may result in more significant simplifications. This work contributes also to the theory of tractable CSPs by identifying a new tractable class of binary CSP.
Complete list of metadatas

Cited literature [58 references]  Display  Hide  Download
Contributor : Wady Naanaa <>
Submitted on : Monday, May 25, 2020 - 12:02:53 PM
Last modification on : Friday, June 5, 2020 - 3:36:48 AM


Files produced by the author(s)


  • HAL Id : hal-01731250, version 4



Wady Naanaa. New schemes for simplifying binary constraint satisfaction problems. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, vol. 22 no. 1. ⟨hal-01731250v4⟩



Record views


Files downloads