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
Answer Set Programming Based on Propositional Satisfiability
TL;DR: This paper presents a SAT-based procedure, called ASPSAT, that deals with any (nondisjunctive) logic program, works on a propositional formula without additional variables (except for those possibly introduced by the clause form transformation), and is guaranteed to work in polynomial space.
Proceedings Article
The effect of restarts on the efficiency of clause learning
TL;DR: There is strong evidence that a clause learning SAT solver could benefit substantially from a carefully designed restart policy (which may not yet be available), and motivation for the design of better restart policies, particularly dynamic ones.
BookDOI
Automated Deduction—CADE-18
TL;DR: DAML+OIL is a description logic based ontology language specifically designed for use on the web, and the logical basis of the language means that reasoning services can be provided, both to support ontology design and to make described web resources more accessible to automated processes.
Book ChapterDOI
The Quest for Efficient Boolean Satisfiability Solvers
Lintao Zhang,Sharad Malik +1 more
TL;DR: The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications as mentioned in this paper.
Proceedings ArticleDOI
Automatic generation of peephole superoptimizers
Sorav Bansal,Alex Aiken +1 more
TL;DR: It is shown experimentally that the fully automatic construction of peephole optimizers using brute force superoptimization is able to exploit performance opportunities not found by existing compilers, and speedups from 1.7 to a factor of 10 on some compute intensive kernels over a conventional optimizing compiler are shown.
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.