## Algorithms for the Satisfiability (SAT) Problem: A Survey (1996)

Venue: | DIMACS Series in Discrete Mathematics and Theoretical Computer Science |

Citations: | 127 - 3 self |

### BibTeX

@INPROCEEDINGS{Gu96algorithmsfor,

author = {Jun Gu and Paul W. Purdom and John Franco and Benjamin W. Wah},

title = {Algorithms for the Satisfiability (SAT) Problem: A Survey},

booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},

year = {1996},

pages = {19--152},

publisher = {American Mathematical Society}

}

### Years of Citing Articles

### OpenURL

### Abstract

. The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the sat...