• Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper)
  • Contributor: Li, Hongbo [Author]; Yin, Minghao [Author]; Li, Zhanshan [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.CP.2021.9
  • Keywords: Failure Rate ; Failure Length ; Variable Ordering Heuristic ; Constraint Satisfaction Problem
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: Variable ordering heuristics play a central role in solving constraint satisfaction problems. In this paper, we propose failure based variable ordering heuristics. Following the fail first principle, the new heuristics use two aspects of failure information collected during search. The failure rate heuristics consider the failure proportion after the propagations of assignments of variables and the failure length heuristics consider the length of failures, which is the number of fixed variables composing a failure. We performed a vast experiments in 41 problems with 1876 MiniZinc instances. The results show that the failure based heuristics outperform the existing ones including activity-based search, conflict history search, the refined weighted degree and correlation-based search. They can be new candidates of general purpose variable ordering heuristics for black-box CSP solvers.
  • Access State: Open Access