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
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter
TL;DR: In this paper, the authors provide a comprehensive account of the constraint answer set language and solver ezcsp, a mainstream representative of this research area that has been used in various successful applications.
Book ChapterDOI
Fundaments of Branching Heuristics
TL;DR: The topic of this chapter is to provide foundations for “branching heuristics”, where developments in the last four decades can be comprised in what actually deserves to be called a “theory”.
Proceedings ArticleDOI
Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer
TL;DR: Rewriting rules and positive equality are combined in an automatic way in order to formally verify out-of-order processors that have a Reorder Buffer and can issue/retire multiple instructions per clock cycle.
Journal ArticleDOI
CUD@SAT: SAT solving on GPUs
TL;DR: This paper investigates the use of GPUs in parallelising a class of search problems, where the combinatorial nature leads to large parallel tasks and relatively less natural symmetries, leading to one order of magnitude of speedup using a simple NVIDIA platform.
Journal ArticleDOI
Property Learning Techniques for Efficient Generation of Directed Tests
Mingsong Chen,Prabhat Mishra +1 more
TL;DR: The goal is to exploit both variable assignments and common conflict clauses of the prechecked partial or similar SAT instances for property falsification to improve the overall test generation time.
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.