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
Book ChapterDOI
Learning-Sensitive Backdoors with Restarts
Edward Zulkoski,Ruben Martins,Christoph M. Wintersteiger,Robert Robere,Jia Hui Liang,Krzysztof Czarnecki,Vijay Ganesh +6 more
TL;DR: This paper proves that when backjumping is disallowed, LSR backdoors can be exponentially smaller than LS backdoors, and demonstrates that rapid restart policies tend to produce more “local” proofs than other heuristics, in terms of the number of unique variables found in learned clauses of the proof.
The SAT2002 Competition (preliminary draft)
Laurent Simon,Edward A. Hirsch +1 more
TL;DR: The results of the SAT Competition 2002 are given, the interpretations are tried, and suggestions for future competitions are given.
Journal ArticleDOI
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
TL;DR: This paper proposes a unifying framework for implementing memorization in exact branching algorithms dedicated to sequencing problems and leads to the paradigm of Branch & Memorize and its implementation to three classical single machine problems is validated by an extensive computational experimentation that shows that the mentioned paradigm consistently improves existing exact branches.
New Solving Techniques for Property Checking of Arithmetic Data Paths
TL;DR: An effective algebraic approach based on a Grobner basis theory that allows to efficiently decide arithmetic problems is proposed and described which is required to restore all the necessary arithmetic description from custom-designed components.
Proceedings ArticleDOI
Generalized counterexamples to liveness properties
TL;DR: Experiments confirm the capability of the k-LIVENESS proof technique and dedicated algorithms to search for and manipulate generalized counterexamples to and from concrete ones to detect failures more efficiently than existing techniques for various 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.