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 Circuit SAT Solver With Signal Correlation Guided Learning
TL;DR: This paper proposes an entirely different SAT solver design concept that is circuit-based, and is able to utilize circuit topological information and signal correlations to enforce a decision ordering that is more efficient for solving circuit- based SAT problem instances.
Book ChapterDOI
Deciding Separation Formulas with SAT
TL;DR: In this article, a reduction to propositional logic from a Boolean combination of inequalities of the form vi? vj+ c and vi > vj + c, where c is a constant and vi, vj are variables of type real or integer, is presented.
Journal ArticleDOI
Automatic Fault Localization for Property Checking
TL;DR: An efficient fully automatic approach to fault localization for safety properties stated in linear temporal logic is presented by solving the satisfiability of a propositional Boolean formula using the proper decision heuristics and simulation-based preprocessing.
Journal ArticleDOI
Explaining the cumulative propagator
TL;DR: This article shows how, once the authors use lazy clause generation, modelling the cumulative constraint by decomposition creates a highly competitive version of cumulative, and shows how this can create global cumulative constraints that explain their propagation.
Journal ArticleDOI
QBF-Based Formal Verification: Experience and Perspectives
TL;DR: The use and the benefits of restricted quantifiers, QBF certificates, alternative encodings for classical model checking problems, andencodings with free variables are described, which seem to reverse the negative standing of QBF applied to FV.
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.