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
Book ChapterDOI
An Extensible SAT-solver
Niklas Een,Niklas Sörensson +1 more
TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
Book
Constraint Processing
TL;DR: Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Book ChapterDOI
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Alessandro Cimatti,Edmund M. Clarke,Enrico Giunchiglia,Fausto Giunchiglia,Marco Pistore,Marco Roveri,Roberto Sebastiani,Armando Tacchella +7 more
TL;DR: This paper describes version 2 of the NuSMV tool, a state-of-the-art symbolic model checker designed to be applicable in technology transfer projects and is robust and close to industrial systems standards.
Book ChapterDOI
A Tool for Checking ANSI-C Programs
TL;DR: The tool supports almost all ANSI-C language features, including pointer constructs, dynamic memory allocation, recursion, and the float and double data types, and is integrated into a graphical user interface.
References
More filters
Book ChapterDOI
Local search and the number of solutions
TL;DR: This paper examines the relationship between search cost and number of solutions at different points across the phase transition, for three different local search procedures, across two problem classes (CSP and SAT).
Proceedings ArticleDOI
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW
TL;DR: This work compares SAT-checkers and decision diagrams on the evalua-tion of Boolean formulas produced in the formal verification of both correct and buggy versions of superscalar and VLIW micro-processors and identifies one SAT- checker that significantly out-performs the rest.
Proceedings Article
Profile-based algorithms to solve multiple capacitated metric scheduling problems
TL;DR: In this article, the authors present a progression of algorithms for solving multiple-capacitated scheduling problems, and evaluate the performance of each with respect to problem solving ability and quality of solutions generated.
Journal Article
Using randomization and learning to solve hard real-world instances of satisfiability
L.F. Baptista,Joao Marques-Silva +1 more
TL;DR: Examples of SAT from the hardware verification domain are used to provide evidence that randomization can indeed be essential in solving real-world satisfiable instances of SAT and results indicate that randomized restarts and learning may cooperate in proving both satisfiability and satisfaction.
Proceedings ArticleDOI
A study of proof search algorithms for resolution and polynomial calculus
Maria Luisa Bonet,Nicola Galesi +1 more
TL;DR: It is shown that the direct translation to polynomials of a CNF formula having short resolution proofs, cannot be refuted in PC with degree less than /spl Omega/ (log n).