Backjump-based techniques versus conflict-directed heuristics
Christophe Lecoutre, Frédéric Boussemart, Fred Hémery · 2005
We present a general algorithm which gives a uniform view of several state-of-the-art systematic backtracking search algorithms for solving both binary and nonbinary CSP instances. More precisely, this algorithm integrates the most usual or/and sophisticated look-back and look-ahead schemes. By means of this algorithm, our purpose is then to study the interest of backjump-based techniques with respect to conflict-directed variable ordering heuristics.