A New Method for Solving Hard Satis ability Problems

Abstract

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… (More)

Topics

Cite this paper

@inproceedings{Selman1992ANM, title={A New Method for Solving Hard Satis ability Problems}, author={Bart Selman and Hector J. Levesque}, year={1992} }