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
Journal ArticleDOI
Complexity issues related to propagation completeness
TL;DR: Several complexity issues related to empowering implicates, propagation completeness, and its relation to resolution proofs are studied.
Grid based propositional satisfiability solving
TL;DR: This work studies how grid and cloud computing can be applied to efficiently solving propositional satisfiability problem (SAT) instances by combining clause learning, a key technique in modern SAT solvers, with the novel types of parallel solvers.
Journal ArticleDOI
Parallel search for maximum satisfiability
TL;DR: Experimental results show that the techniques proposed in the paper enable PWBO to improve when increasing the number of threads, and this paper introduces PWBO, a new parallel solver for partial MaxSAT.
Book ChapterDOI
Boosting local search thanks to CDCL
TL;DR: A novel hybrid and complete approach for propositional satisfiability, called SATHYS (Sat Hybrid Solver), is introduced, which efficiently combines the strength of both local search and CDCL based SAT solvers.
Book ChapterDOI
Delayed theory combination vs. nelson-oppen for satisfiability modulo theories: a comparative analysis
TL;DR: A comparative analysis of Dtc vs. NO for SMT shows that, using state-of-the-art SAT-solving techniques, the amount of boolean branches performed by Dtc can be upper bounded by the number of deductions and boolean branches performing by NO on the same problem.
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.