Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
Matthew W. Moskewicz,Conor F. Madigan,Ying Zhao,Lintao Zhang,Sharad Malik +4 more
- pp 530-535
TLDR
The development of a new complete solver, Chaff, is described 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.Abstract:
Boolean satisfiability is probably the most studied of the 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.read more
Citations
More filters
Proceedings ArticleDOI
A proof engine approach to solving combinational design automation problems
TL;DR: A proof engine framework where individual analyses are viewed as strategies---functions between different proof states is presented, and one of the strategies, variable instantiation, is new.
Journal ArticleDOI
Equivalent literal propagation in the DLL procedure
TL;DR: Equivalent literal propagation remedies the ineffectiveness of unit propagation on equivalent literals and makes easy many SAT problems containing both usual CNF clauses and the so-called equivalency clauses (Ex-OR or modulo 2 arithmetics).
Book ChapterDOI
Answer Set Planning under Action Costs
TL;DR: Kc is presented, which extends the declarative planning language K by action costs and optimal plans that minimize overall action costs (cheapest plans), and supports the claim that answer set planning may be a valuable approach to advanced planning systems in which intricate planning tasks can be naturally specified and effectively solved.
Book ChapterDOI
Verifying propositional unsatisfiability: pitfalls to avoid
TL;DR: This work Extracting a resolution derivation from the conflict graph is theoretically straightforward, but it turns out to have some surprising practical pitfalls (as well as the unsurprising problem that resolution proofs can be extremely long).
Journal ArticleDOI
Clause Weighting Local Search for SAT
TL;DR: Additive weighting can outperform multiplicative weighting on a range of difficult problems, while requiring considerably less effort in terms of parameter tuning, contradicting earlier conjecture that additive weighting has better performance due to having a larger selection of possible moves.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Book
A machine program for theorem-proving
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.