Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability

GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure. GSAT also efficiently solves encodings of graph coloring problems, N-queens, and Boolean induction. However, GSAT does not perform as well on handcrafted encodings of blocks-world planning problems and formulas with a high degree of asymmetry. We present three strategies that dramatically improve GSAT's performance on such formulas. These strategies, in effect, manage to uncover hidden structure in the formula under considerations, thereby significantly extending the applicability of the GSAT algorithm.

[1]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

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

[3]  Jun Gu,et al.  Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[4]  Yumi K. Tsuji,et al.  EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS , 1992 .

[5]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[6]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[7]  R. Leighton,et al.  Feynman Lectures on Physics , 1971 .

[8]  Mauricio G. C. Resende,et al.  A continuous approach to inductive inference , 1992, Math. Program..

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

[10]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[11]  James M. Crawford,et al.  Experimental Results on the Crossover Point inSatis ability , 1993 .

[12]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[13]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[14]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[15]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[16]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[17]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.