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
Journal ArticleDOI
Conformant planning via heuristic forward search: a new approach
Jörg Hoffmann,Ronen I. Brafman +1 more
TL;DR: This work extends the classical heuristic planning system FF to the conformant setting, adding approximative CNF reasoning in FF's heuristic function and shows Conformant-FF to be superior to the state-of-the-art conformant planners MBP, KACMBP, and GPT in a variety of benchmark domains.
Journal ArticleDOI
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Martin Fränzle,Christian Herde +1 more
TL;DR: HySAT is presented, a bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL–based pseudo–Boolean SAT solver and a linear programming routine as core engine and it is demonstrated that those optimizations are crucial to the performance of the tool.
Book ChapterDOI
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
TL;DR: In this article, the authors investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains and investigate the lazy integration of SAT solving and theorem proving.
Posted Content
Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers.
TL;DR: Methods for efficiently converting systems of low-degree sparse multivariate equations into a conjunctive normal form satisfiability (CNF-SAT) problem, for which excellent heuristic algorithms have been developed in recent years are studied.
Book ChapterDOI
Bounded model checking of software using SMT solvers instead of SAT solvers
TL;DR: This paper proposes a generalisation of the CBMC approach based on an encoding into richer (but still decidable) theories than propositional logic, and shows that this approach may lead to considerably more compact formulae than those obtained with CBMC.
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.