Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Synthesizing constraint expressions
Communications of the ACM
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A theoretical comparison of selected csp solving and modeling techniques
A theoretical comparison of selected csp solving and modeling techniques
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Determining if (FC-) (conflict-directed) back jumping visits a given node is NP-hard
Artificial Intelligence
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
Enhancing DLV instantiator by backjumping techniques
Annals of Mathematics and Artificial Intelligence
A Flexible Search Framework for CHR
Constraint Handling Rules
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Conflict directed backjumping for Max-CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Design Problems, Frames and Innovative Solutions
Proceedings of the 2009 conference on Design Problems, Frames and Innovative Solutions
The effect of Nogood recording in DPLL-CBJ SAT algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classified as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-ahead techniques is sometimes counterproductive to the effects of look-back techniques. In this paper, we focus on the relationship between the two most important look-ahead techniques--using a variable ordering heuristic and maintaining a level of local consistency during the backtracking search--and the look-back technique of conflict-directed backjumping (CBJ). We show that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant. We also show theoretically that as the level of local consistency that is maintained in the backtracking search is increased, the less that backjumping will be an improvement. Our theoretical results partially explain why a backtracking algorithm doing more in the look-ahead phase cannot benefit more from the backjumping look-back scheme. Finally, we show empirically that adding CBJ to a backtracking algorithm that maintains generalized arc consistency (GAC), an algorithm that we refer to as GAC-CBJ, can still provide orders of magnitude speedups. Our empirical results contrast with Bessière and Régin's conclusion (1996) that CBJ is useless to an algorithm that maintains arc consistency.