Zchaff2004: An Efficient SAT Solver

  • Yogesh S. Mahajan
  • Zhaohui Fu
  • Sharad Malik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3542)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yogesh S. Mahajan
    • 1
  • Zhaohui Fu
    • 1
  • Sharad Malik
    • 1
  1. 1.Princeton UniversityPrincetonUSA

Personalised recommendations