Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Heuristic techniques for variable and value ordering in CSPs
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In this paper, we present a general algorithm which gives an uniform view of several state-of-the-art systematic back-tracking search algorithms for solving both binary and non-binary 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.