• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Chaff: Engineering an Efficient SAT Solver (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.wm.edu]
  • [www.cs.wm.edu]
  • [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.princeton.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [people.cs.ubc.ca]
  • [www.cs.cmu.edu]
  • [www.informatik.uni-bremen.de]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.icsd.aegean.gr]
  • [www.cs.uu.nl]
  • [www.cis.upenn.edu]
  • [www.cs.cmu.edu]
  • [www.lri.fr]
  • [people.cs.ubc.ca]
  • [www.informatik.uni-bremen.de]
  • [www.cs.york.ac.uk]
  • [www.sigda.org]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
Citations:1348 - 18 self
  • Summary
  • Citations
  • 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}
}

Share

Facebook Twitter Reddit Bibsonomy

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.

Keyphrases

efficient sat solver    public domain    efficient implementation    significant use    problem instance    significant effort    practical solution    complete solver    new complete solver    difficult sat benchmark    boolean satisfiability    combinatorial optimization search problem    several sat package    significant performance gain    careful engineering    magnitude performance improvement    boolean constraint propagation    search algorithm    novel low overhead decision strategy    artificial intelligence    electronic design automation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University