Variable elimination in binary CSPs

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-02142769
Contributor : Cyril Terrioux <>
Submitted on : Tuesday, May 28, 2019 - 6:48:08 PM
Last modification on : Thursday, October 24, 2019 - 2:44:12 PM

Links full text

Identifiers

  • HAL Id : hal-02142769, version 1
  • ARXIV : 1905.04209

Citation

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

Share

Metrics

Record views

35