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 defines a novel tractable class. Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without.
Document type :
Journal articles
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02338904
Contributor : Cyril Terrioux <>
Submitted on : Monday, November 4, 2019 - 10:55:40 AM
Last modification on : Tuesday, November 5, 2019 - 1:33:54 AM

File

11295-Article (PDF)-22350-1-10...
Publisher files allowed on an open archive

Identifiers

Citation

Martin Cooper, Achref Mouelhi, Cyril Terrioux. Variable Elimination in Binary CSPs. Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2019, 66, pp.589 - 624. ⟨10.1613/jair.1.11295 ⟩. ⟨hal-02338904⟩

Share

Metrics

Record views

37

Files downloads

41