DMCA
A New Method for Solving Hard Satisfiability Problems (1992)
Cached
Download Links
- [ftp.research.att.com]
- [ftp.cs.unh.edu]
- [portal.research.bell-labs.com]
- DBLP
Other Repositories/Bibliography
| Venue: | AAAI |
| Citations: | 725 - 21 self |
BibTeX
@INPROCEEDINGS{Selman92anew,
author = {Bart Selman and Hector Levesque and David Mitchell},
title = {A New Method for Solving Hard Satisfiability Problems},
booktitle = {AAAI},
year = {1992},
pages = {440--446},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
new method hard satisfiability problem greedy local search procedure model-finding procedure model-finding task davis-putnam procedure traditional approach structured satisfiability problem good performance boolean induction propositional satisfiability problem theorem-proving problem general application strategy
