Conflict History based Search for Constraint Satisfaction Problem - Archive ouverte HAL Access content directly
Conference Papers Year :

Conflict History based Search for Constraint Satisfaction Problem

Djamal Habet
  • Function : Author
  • PersonId : 940715
Cyril Terrioux


Branching heuristic is an important module in algorithms dedicated to solve Constraint Satisfaction Problems (CSP). It impacts the efficiency of exploring the search space and exploiting the problem structure. In this paper, we propose Conflict-History Search (CHS), a dynamic and adaptive branching heuristic for CSP solving. It is based on the search failures and considers the temporality of these failures throughout the resolution process. The exponential recency weighted average is used to estimate the evolution of the hardness of constraints throughout the search. The experimental evaluation on XCSP3 instances shows that integrating CHS to solvers based on MAC obtains competitive results and can improve those obtained by other heuristics of the state of the art, such as dom/wdeg and ABS.
Fichier principal
Vignette du fichier
article.pdf (421.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02090618 , version 1 (20-05-2020)



Djamal Habet, Cyril Terrioux. Conflict History based Search for Constraint Satisfaction Problem. Proceedings of the 34th ACM/SIGAPP Symposium On Applied Computing (SAC), Apr 2019, Limassol, Cyprus. ⟨10.1145/3297280.3297389⟩. ⟨hal-02090618⟩
119 View
141 Download



Gmail Facebook Twitter LinkedIn More