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
Journal ArticleDOI
Optimal rectangle packing
Richard E. Korf,Eric J. Huang +1 more
TL;DR: This work considers the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles, and presents two different constraint-satisfaction formulations of this problem that dramatically outperform previous approaches to optimal rectangle packing.
Dissertation
Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis
TL;DR: This dissertation contains algorithms for solving linear and polynomial systems of equations over GF (2) and contains proofs that matrix multiplication, matrix squaring, triangular matrix inversion, LUP-factorization, general Matrix inversion and the taking of determinants, are equicomplex.
Journal ArticleDOI
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
TL;DR: This work presents the AND/OR Multi-Valued Decision Diagram (AOMDD) which compiles a graphical model into a canonical form that supports polynomial ( e.g., solution counting, belief updating) or constant time (e.g. equivalence of graphical models) queries.
Journal Article
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT
TL;DR: This paper proposes an efficient algorithm for logic synthesis based on the Incremental Boolean Satisfiability (SAT) approach and shows that this technique leads not only to huge memory savings when compared with the methods based on reachability graphs, but also to significant speedups in many cases, without affecting the quality of the solution.
Journal ArticleDOI
Domain reduction techniques for global NLP and MINLP optimization
TL;DR: This work surveys the various techniques used for domain reduction of NLP and MINLP optimization problems and presents a computational analysis of the impact of these techniques on the performance of various widely available global solvers on a collection of 1740 test problems.
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.