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
Journal ArticleDOI
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
TL;DR: In this paper, a rule-based system for computer-aided circuit analysis, called EL, is presented, which is written in a rule language called ARS, and implemented by ARS as pattern-directed invocation demons monitoring an associative data base.
Proceedings ArticleDOI
Symbolic model checking using SAT procedures instead of BDDs
TL;DR: This paper applies bounded model checking to equivalence and invariant checking and presents several optimizations that reduce the size of generated propositional formulas in hardware verification.
Proceedings ArticleDOI
BerkMin: A Fast and Robust Sat-Solver
Eugene Goldberg,Yakov Novikov +1 more
TL;DR: A SAT-solver is described that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause "aging" and introduces a new decision making procedure and a new method of clause database management.
Journal ArticleDOI
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
TL;DR: The time complexity of several node, arc and path consistency algorithms is analyzed and it is proved that arc consistency is achievable in time linear in the number of binary constraints.
Proceedings Article
Valued constraint satisfaction problems: hard and easy problems
TL;DR: A simple algebraic framework is considered, related to Partial Constraint Satisfaction, which subsumes most of these proposals and is used to characterize existing proposals in terms of rationality and computational complexity.