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
Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver
Armin Biere,Robert Brummayer +1 more
TL;DR: This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver and presents a new compact encoding of equalities and inequalities over bit -vectors in CNF.
Journal ArticleDOI
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
TL;DR: In this paper, the authors propose algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas, which yield unsatisfiable subformulas that become satisfiable when any of their clauses or variable is removed.
Book ChapterDOI
SAT-Based Model Checking
Armin Biere,Daniel Kröning +1 more
TL;DR: This chapter covers the application of bounded model checking to both hardware and software systems, and to hardware/software co-verification, and means to make BMC complete, including \(k\)-induction, Craig interpolation, abstraction refinement techniques, and inductive techniques with iterative strengthening.
Book ChapterDOI
Scheduling Optional Tasks with Explanation
TL;DR: This paper shows it can model interval variables in a lazy clause generation solver, and create explaining propagators for scheduling constraints using these interval variables, and appears to give a powerful new solving approach to scheduling problems with optional tasks.
Proceedings ArticleDOI
Using QBF to increase accuracy of SAT-based debugging
TL;DR: An approach is proposed that integrates formal verification with diagnosis and ensures, that counterexamples of high quality are returned and the total number of fault candidates decreases and less iterations between verification and debugging are required.
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.