Conflict History Based Branching Heuristic for CSP Solving

International audienceAn 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

Conflict History based Search for Constraint Satisfaction Problem

International audienc

Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size

International audienceno abstrac