Variable elimination in binary CSPs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Variable elimination in binary CSPs


We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We study variable-elimination rules based on the language of forbidden patterns enriched with counting and quantification over variables and values. We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each define a novel tractable class. Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without.
Fichier principal
Vignette du fichier
1905.04209.pdf (629.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02142769 , version 1 (16-02-2021)



Martin Cooper, Achref El Mouelhi, Cyril Terrioux. Variable elimination in binary CSPs. 2019. ⟨hal-02142769⟩
183 View
45 Download



Gmail Facebook Twitter LinkedIn More