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
Multi-Domain Clock Skew Scheduling
TL;DR: This paper presents an algorithm for constrained clockskew scheduling which computes for a given number of clockingdomains the optimal phase shifts for the domains and the assignment of the individual registers to the domains.
Proceedings ArticleDOI
Learning for quantified boolean logic satisfiability
TL;DR: This work introduces learning as a general purpose technique to improve the performances of decision procedures for Quantified Boolean Formulas (QBFs) and implements it in QUBE, a state-of-the-art QBF solver, for QBF satisfiability.
Book ChapterDOI
A tutorial on satisfiability modulo theories
TL;DR: This tutorial presentation is primarily directed at those who wish to build satisfiability solvers or to use existing solvers more effectively.
Book ChapterDOI
Watched literals for constraint propagation in minion
TL;DR: In this paper, watched literals are used to provide highly efficient implementations of constraint propagators, such as the sum of Boolean variables, element constraint, table constraint, and element constraint.
Book ChapterDOI
Robust SAT-Based Search Algorithm for Leakage Power Reduction
TL;DR: The results indicate that using a such a generic SAT solver can improve on previously proposed random approaches, and the solver is called as a post-process to a random-vector-generation approach.
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.