Variable Elimination in Binary CSPs (Extended Abstract) - Aix-Marseille Université Access content directly
Conference Papers Year : 2020

Variable Elimination in Binary CSPs (Extended 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.
Fichier principal
Vignette du fichier
0702.pdf (156.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



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 {IJCAI-PRICAI-20}, Jul 2020, Yokohama, France. pp.5035-5039, ⟨10.24963/ijcai.2020/702⟩. ⟨hal-02897892⟩
133 View
48 Download



Gmail Facebook X LinkedIn More