Satisfiability Solvers

  title={Satisfiability Solvers},
  author={Carla P. Gomes and Henry A. Kautz and Ashish Sabharwal and Bart Selman},
  booktitle={Handbook of Knowledge Representation},
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known algorithms, satisfiability solvers are increasingly leaving their mark as a general-purpose tool in areas as diverse as software and hardware verification [29–31, 228], automatic test pattern generation [138, 221], planning [129, 197], scheduling [103], and even challenging problems from algebra [238]. Annual SAT competitions have… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 206 citations. REVIEW CITATIONS
123 Citations
234 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 123 extracted citations

206 Citations

Citations per Year
Semantic Scholar estimates that this publication has 206 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 234 references

Algorithmic Applications of Propositional Proof Complexity

  • A. Sabharwal
  • PhD thesis, University of Washington, Seattle
  • 2005
Highly Influential
8 Excerpts

MiniSat: A SAT solver with conflict-clause minimization

  • N. Eén, N. Sörensson
  • 2005
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…