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
Incremental deductive & inductive reasoning for SAT-based bounded model checking
TL;DR: A novel idea to combine SAT-based inductive reasoning and BMC, clever orchestration of variable ordering and learned information in an incremental framework for BMC, and BMC-specific ordering strategies for the SAT solver are proposed.
Book ChapterDOI
A logic-based hybrid solver for optimal control of hybrid systems
Alberto Bemporad,N. Giorgetti +1 more
TL;DR: This paper details how to model the hybrid dynamics so that the optimal control problem can be solved by the hybrid MIP+CP solver, and shows on a case study that the achieved performance is superior to the one achieved by pure MIP solvers.
Journal ArticleDOI
Extracting verified decision procedures: DPLL and Resolution
TL;DR: In this article, the authors apply the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction, and prove the equivalence between the resolution proof system and the DPLL proof system.
Book ChapterDOI
QuBE++: An efficient QBF solver
TL;DR: QuBE++ is the first QBF reasoning engine that uses lazy data structures both for unit clauses propagation and for pure literals detection, and features non-chronological backtracking and a branching heuristic that leverages the information gathered during the backtracking phase.
Book ChapterDOI
Guiding SAT Diagnosis with Tree Decompositions
TL;DR: This paper reports on the effort to learn whether the theoretical applicability of tree decomposition to SAT can be made to work in practice, and presents experimental results demonstrating that the method proposed can decrease the number of necessary decisions by one or more orders of magnitude.
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.