Zchaff2004: An efficient SAT solver

Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik

Research output: Contribution to journalConference article

70 Scopus citations

Abstract

The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the use of SAT solvers in diverse domains such as electronic design automation and artificial intelligence. These applications continue to motivate the development of faster and more robust SAT solvers. In this paper, we describe the popular SAT solver zchaff with a focus on recent developments.

Original languageEnglish (US)
Pages (from-to)360-375
Number of pages16
JournalLECTURE NOTES IN COMPUTER SCIENCE
Volume3542
DOIs
StatePublished - Jan 1 2005
Event7th International Conference on Theory and Applications of Satisfiability Testing, SAT 2004 - Vancouver, BC, Canada
Duration: May 10 2004May 13 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Zchaff2004: An efficient SAT solver'. Together they form a unique fingerprint.

Cite this