We introduce a greedy local search procedure called GSAT for solving propositional satis ability ... more We introduce a greedy local search procedure called GSAT for solving propositional satis ability 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 satis ability 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.
Uploads
Papers by David Mitchell