A New Method for Solving Hard Satisfiability Problems

We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to 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 or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, N-queens, and Boolean induction. General application strategies and limitations of the approach are also discussed. GSAT is best viewed as a model-finding procedure. Its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.

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

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[5]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[6]  Bernd-Jürgen Falkowski,et al.  A Note on the Queens' Problem , 1986, Inf. Process. Lett..

[7]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[8]  Raymond Reiter,et al.  A Logical Framework for Depiction and Image Interpretation , 1989, Artif. Intell..

[9]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[10]  A. Vellino.  The complexity of automated reasoning , 1990 .

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

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

[13]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

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

[15]  Christos H. Papadimitriou,et al.  On the Greedy Algorithm for Satisfiability , 1992, Information Processing Letters.

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

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

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

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