Conflict History Based Branching Heuristic for CSP Solving - Aix-Marseille Université Access content directly
Conference Papers Year :

Conflict History Based Branching Heuristic for CSP Solving

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


An important feature in designing algorithms to solve Constraint Satisfaction Problems (CSP) is the definition of a branching heuristic to explore efficiently the search space and exploit the problem structure. We propose Conflict-History Search (CHS), a new dynamic and adaptive branching heuristic for CSP solving. It is based on the search history by considering the temporality of search failures. To achieve that, we use the exponential recency weighted average 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 through other heuristics of the state of the art.
Fichier principal
Vignette du fichier
CIMA2018_paper_6.pdf (417.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02090610 , version 1 (04-04-2019)


  • HAL Id : hal-02090610 , version 1


Djamal Habet, Cyril Terrioux. Conflict History Based Branching Heuristic for CSP Solving. Proceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA), Nov 2018, Volos, Greece. ⟨hal-02090610⟩
131 View
305 Download


Gmail Facebook Twitter LinkedIn More