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
Book
Design Automation of Real-Life Asynchronous Devices and Systems
TL;DR: Four design flows are presented that can tackle large designs without significant changes with respect to synchronous design flow, and offer a trade-off from very low overhead, almost synchronous implementations, to very high performance, extremely robust dual-rail pipelines.
Proceedings Article
An experimentally efficient method for (MSS,CoMSS) partitioning
TL;DR: A novel algorithm for partitioning a Boolean CNF formula into one MSS and the corresponding CoMSS is introduced, which is more robust and more efficient on most instances than currently available techniques.
Journal ArticleDOI
The CADE-16 ATP System Competition
TL;DR: The results of the CADE-16 ATP System Competition (CASC-16) are presented.
Proceedings ArticleDOI
Fast exact Toffoli network synthesis of reversible logic
Robert Wille,Daniel Grosse +1 more
TL;DR: This paper presents an improvement of an existing synthesis approach that is based on Boolean Satisfiability, and proposes a new method using problem specific knowledge during the synthesis process to overcome limits.
iDQ: Instantiation-Based DQBF Solving
TL;DR: This paper presents an instantiation-based technique to solve Dependency Quantified Boolean Formulas efficiently and proposes a concrete implementation of the algorithm.
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.