Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2015

Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns

Résumé

Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability of an instance. We show that there are essentially just four variable elimination rules and three value elimination rules defined by forbidding generic sub-instances, known as irreducible existential patterns, in arc-consistent CSP instances. One of the variable elimination rules is the already-known Broken Triangle Property, whereas the other three are novel. The three value elimination rules can all be seen as strict generalisations of neighbourhood substitution.
Fichier principal
Vignette du fichier
Cohen_14812.pdf (1.12 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01280349 , version 1 (09-03-2016)

Identifiants

Citer

David Cohen, Martin Cooper, Guillaume Escamocher, Stanislas Zivny. Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns. Journal of Computer and System Sciences, 2015, 81 (7), pp.1127-1143. ⟨10.1016/j.jcss.2015.02.001⟩. ⟨hal-01280349⟩
75 Consultations
179 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More