Variable Elimination in Binary CSPs (Extended Abstract) - ANITI - Artificial and Natural Intelligence Toulouse Institute Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Variable Elimination in Binary CSPs (Extended Abstract)

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

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⟩
134 Consultations
48 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More