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
Dissertation
Parallel SAT solvers and their application in automatic parallelization
TL;DR: SAT-PaDdlinG is a parallel DPLL SAT Solver on GPU, which allows RePaSAT to use this environment and aims at providing this massive parallelism and low cost to Re PaSAT, as well as to any other tool or problem that uses SAT Solvers.
Journal ArticleDOI
Complete Boolean Satisfiability Solving Algorithms Based on Local Search
TL;DR: A translation method and three effective complete SAT solving algorithms based on the characterization of Model RB structure are proposed that translate clauses into a graph with exclusive sets and relative sets and determine search order using vertex weights and clique in the graph.
Proceedings ArticleDOI
A modular CNF-based SAT solver
TL;DR: A modular CNF-based SAT solver that implements several techniques and heuristics such as those proposed by Goldberg and Novikov in BerkMin, and in Equivalence Checking of Dissimilar Circuits, and by Niklas Een and Niklas Sorensson in Minisat is presented.
Dissertation
Solving quantified boolean formulas
TL;DR: This thesis presents several techniques to advance search-based algorithms in the context of solving quantified boolean formulas (QBF), which enables complex real-world problems including planning, two-player games and verification to be captured in a compact and quite natural fashion.
Effective SAT solving
TL;DR: Deploying SAT solvers effectively requires implementations that are efficient, yet easily adaptable to specific application needs, as well as describing how to solve a series of related SAT problems efficiently, called incremental SAT solving.
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.