• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Chaff: Engineering an Efficient SAT Solver (2001)

Cached

  • Download as a PDF

Download Links

  • [verify.stanford.edu]
  • [research.microsoft.com]
  • [www.cs.cmu.edu]
  • [www.cs.ubc.ca]
  • [www.cs.cmu.edu]
  • [www.princeton.edu]
  • [www.cs.cmu.edu]
  • [www.tcs.hut.fi]
  • [www.ee.princeton.edu]
  • [www.sigda.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
Citations:909 - 12 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Moskewicz01chaff:engineering,
    author = {Matthew W. Moskewicz and Conor F. Madigan and Ying Zhao and Lintao Zhang and Sharad Malik},
    title = {Chaff: Engineering an Efficient SAT Solver },
    year = {2001}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search – especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO.

Citations

303 GRASP: A search algorithm for propositional satisfiability - Marques-Silva, Sakallah - 1999
182 Using CSP look-back techniques to solve real-world SAT instances - Bayardo, Schrag - 1997
175 SATO: An efficient propositional prover - Zhang - 1997
161 Evidence for Invariants in Local Search - McAllester, Selman, et al. - 1997
141 Improvements to Propositional Satisfiability Search Algorithms - Freeman - 1995
100 Combinational test generation using satisfiability - Stephan, Brayton, et al. - 1996
49 Symbolic model checking without BDDs. Tools and Algorithms for the Analysis and Construction of Systems - Biere, Cimatti, et al. - 1999
46 Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability - Baptista, Marques-Silva - 2000
35 The impact of branching heuristics in propositional satisfiability algorithms - Marques-Silva - 1999
24 Effective Use of Boolean Satisfiability - Velev, Bryant - 2001
23 Reasoning in Boolean Networks - Kunz, Stoffel - 1997
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University