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
Posted Content
Metamodel Instance Generation: A systematic literature review
TL;DR: A systematic literature review of instance generation techniques for metamodels, i.e. the process of automatically generating models from a given meetamodel, identifies a knowledge gap and offers suggestions as to some potential directions for future research.
Journal ArticleDOI
Efficient Analysis of DynAlloy Specifications
TL;DR: It is demonstrated that DynAlloy's semantics allows for a sound technique that is called program atomization, which improves the analyzability of properties regarding execution traces by considering certain programs as atomic steps in a trace.
Journal ArticleDOI
On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs
TL;DR: This paper analyzes new exact approaches for the multi-mode resource-constrained project scheduling (MRCPSP) problem with the aim of makespan minimization and is the first to close (find the optimal solution and prove its optimality for) 628 open instances with 50 and 100 jobs from the literature.
Proceedings ArticleDOI
ATPG-based grading of strong fault-secureness
TL;DR: This work proposes a method to verify the strong fault-secureness by use of constrained SAT-based ATPG by developing rules to derive detectability or redundancy information for multiple faults from the respective information for single faults.
Journal ArticleDOI
Segmented channel routability via satisfiability
TL;DR: This paper encodes the horizontal and vertical constraints of the routing problem as Boolean conditions and shows that the routability constraint is satisfiable if and only if the net connections in the segmented channel are routable.
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.