Learning to Identify Global Bottlenecks in Constraint Satisfaction Search

Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constraint satisfaction problems (CSPs). The information learnt can take various forms such as fine-grained information in the form of no-goods and explanations in CSPs and clause learning in SAT, or coarse-grained information in the form of constraint weighting in CSPs and clause weighting in SAT. In this paper we focus on CSPs, using constraint weighting with restarts in order to identify global bottlenecks in a problem. This information is then used by a “weighted-degree” heuristic to guide complete search, with the belief that instantiating these elements first will reduce the overall search effort required to either find a solution or prove the problem

[1]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[2]  J. Christopher Beck,et al.  Trying Again to Fail-First , 2004, CSCLP.

[3]  Berthe Y. Choueiry,et al.  Characterization of a New Restart Strategy for Randomized Backtrack Search , 2004, CSCLP.

[4]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[5]  Barry O'Sullivan,et al.  The Impact of Search Heuristics on Heavy-Tailed Behaviour , 2006, Constraints.

[6]  R. Wallace,et al.  Learning from Failure in Constraint Satisfaction Search , 2006 .

[7]  Boi Faltings,et al.  Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems , 2003, CP.

[8]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[9]  J. Christopher Beck,et al.  Toward Understanding Variable Ordering Heuristics for Constraint Satisfaction Problems , 2003 .

[10]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[11]  Barbara M. Smith,et al.  Trying Harder to Fail First , 1998, ECAI.

[12]  Lakhdar Sais,et al.  Extracting MUCs from Constraint Networks , 2006, ECAI.

[13]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[14]  Holger H. Hoos,et al.  Warped Landscapes and Random Acts of SAT Solving , 2004, AI&M.

[15]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[16]  Tom M. Mitchell,et al.  Learning from Solution Paths: An Approach to the Credit Assignment Problem , 1982, AI Mag..

[17]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[18]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[19]  Fahiem Bacchus,et al.  Extending Forward Checking , 2000, CP.