Nogood Recording from Restarts

In this paper, nogood recording is investigated within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next one. More precisely, no-goods are recorded when the current cutoff value is reached, i.e. before restarting the search algorithm. Such a set of nogoods is extracted from the last branch of the current search tree. Interestingly, the number of nogoods recorded before each new run is bounded by the length of the last branch of the search tree. As a consequence, the total number of recorded nogoods is polynomial in the number of restarts. Experiments over a wide range of CSP instances demonstrate the effectiveness of our approach.

[1]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[2]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[3]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

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

[5]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[6]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[7]  Karem A. Sakallah,et al.  Conflict analysis in search algorithms for propositional satisfiability , 1996 .

[8]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[9]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[10]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[11]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[12]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

[13]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[14]  J. J. McGregor.  Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

[15]  David G. Mitchell,et al.  2-Way vs. d-Way Branching for CSP , 2005, CP.

[16]  Fahiem Bacchus,et al.  Unrestricted Nogood Recording in CSP Search , 2003, CP.

[17]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[18]  Joao Marques-Silva,et al.  Complete Search Restart Strategies for Satisfiability , 2001 .

[19]  Christophe Lecoutre,et al.  Backjump-based techniques versus conflict-directed heuristics , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[20]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[21]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[22]  Fahiem Bacchus,et al.  Generalized NoGoods in CSPs , 2005, AAAI.

[23]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[24]  David G. Mitchell.  Resolution and Constraint Satisfaction , 2003, CP.

[25]  Hantao Zhang.  A Random Jump Strategy for Combinatorial Search , 2001 .

[26]  Barry O'Sullivan,et al.  Search Heuristics and Heavy-Tailed Behaviour , 2005, CP.

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

[28]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[29]  Philippe Jégou,et al.  Efficient Path-Consistency Propagation , 1998, Int. J. Artif. Intell. Tools.