Skip to Main content Skip to Navigation
Conference papers

Variable Elimination in Binary CSPs (Extended Abstract)

Abstract : We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. 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 :
Conference papers
Complete list of metadata
Contributor : Cyril Terrioux Connect in order to contact the contributor
Submitted on : Tuesday, February 16, 2021 - 11:05:14 AM
Last modification on : Wednesday, November 3, 2021 - 7:16:35 AM
Long-term archiving on: : Monday, May 17, 2021 - 6:53:00 PM


Files produced by the author(s)



Martin Cooper, Achref El Mouelhi, Cyril Terrioux. Variable Elimination in Binary CSPs (Extended Abstract). Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence , Jul 2020, Yokohama, France. pp.5035-5039, ⟨10.24963/ijcai.2020/702⟩. ⟨hal-02897892⟩



Record views


Files downloads