Efficient conflict driven learning in a boolean satisfiability solver
Lintao Zhang,Conor F. Madigan,Matthew H. Moskewicz,Sharad Malik +3 more
- pp 279-285
Reads0
Chats0
TLDR
This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes.Abstract:
One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Extensive experiments with real world examples show that the best performing new learning scheme has at least a 2/spl times/ speedup compared with learning schemes employed in state-of-the-art SAT solvers.read more
Citations
More filters
Proceedings ArticleDOI
How many solutions does a SAT instance have
Pushkin R. Pari,Lin Yuan,Gang Qu +2 more
TL;DR: This work proposes an exact algorithm based on exhaustive search that solves the instance once and finds all solutions (SOFAS) and several sampling techniques that estimate the size of the solution space.
Advances in counterexample-guided abstraction refinement
Edmund M. Clarke,Ofer Strichman +1 more
TL;DR: This report is a collection of six articles on model checking in the abstraction/refinement framework used by various techniques for tackling the state-space explosion problem that is frequently encountered in model checking.
Posted Content
The fast parallel algorithm for CNF SAT without algebra.
TL;DR: In this article, a novel parallel algorithm for solving the classical Decision Boolean Satisfiability problem with clauses in conjunctive normal form is depicted, which is based on the special class of SAT problems, Simple SAT (SSAT).
Dissertation
Finding a satisfying assignment for planted NAE-E3-SAT using a voting style algorithm
TL;DR: In this paper, the MAX-CUT problem in the co-occurrence graph of a random planted 3-SAT formula is solved in polynomial time for the case of not-all-equal clauses, where the clauses added are the Not-All-Equal clauses.
Solving “Hard” Satisfiability Problems Using GridSAT
Wahid Chrabakh,Rich Wolski +1 more
TL;DR: The latest instantiation of GridSAT is presented, a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance and outperforms the otherwise highest performance general solvers on the annual SAT competition performance benchmarks.
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.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
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.