A Hybrid Schema for Systematic Local Search

We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitment to variable assignment of local search. Our method backtracks through a space of complete but possibly inconsistent solutions while supporting the freedom to move arbitrarily under heuristic guidance. The version of the schema described here combines minconflicts local search with conflict-directed backjumping. It is parametrized by a variable ordering relation which controls the order in which the search space is explored. Preliminary experimental results are given comparing two instances of the schema to forward checking with conflict-directed backjumping [17] (FC-CBJ).

[1]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[2]  Inês Lynce,et al.  Stochastic Systematic Search Algorithms for Satisfiability , 2001, Electron. Notes Discret. Math..

[3]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[4]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[5]  William S. Havens.  NoGood Caching for MultiAgent Backtrack Search , 1997 .

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

[7]  S. Prestwich.  Local Search and Backtracking vs Non-Systematic Backtracking , 2001 .

[8]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[9]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

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

[11]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[12]  Toby Walsh,et al.  Local Search and the Number of Solutions , 1996, CP.

[13]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

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

[15]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[16]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[17]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[18]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[19]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[20]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[21]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..