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
A decision-making procedure for resolution-based SAT-solvers
TL;DR: A new decision-making procedure for resolutionbased SAT-solvers called Decision Making with a Reference Point (DMRP) is described, which makes it possible for a DPLL-like algorithm to perform a "local search strategy".
Journal Article
A Signal Correlation Guided Circuit-SAT Solver
TL;DR: A circuit-S AT solver SC-C-SAT is implemented based on the proposed heuristics and the concepts used in other state-of-the-art SAT solvers, able to achieve speedup of one order of magnitude over other state of theart SATsolvers that do not use the heuristic.
Journal ArticleDOI
The External Interface for Extending WASP.
Carmine Dodaro,Francesco Ricca +1 more
TL;DR: The interface for extending the CDCL-based ASP solver wasp is presented and it is shown that it can be successfully used to extend wasp for solving effectively hard instances of both real-world and synthetic problems.
Dissertation
Managing complex scheduling problems with dynamic and hybrid constraints
TL;DR: This dissertation introduces a new representation called the Dynamic Disjunctive Temporal Problem, along with several techniques to improve both efficiency and stability when solving one, and considers scheduling problems in which a mixture of finite-domain and temporal variables can interact through hybrid constraints.
A dependently typed language with nontermination
TL;DR: It is proved type saftey for a large subset of the Zombie core language, including features such as computational irrelevance, CBV-reduction, and propositional equality with a heterogeneous, completely erased elimination form.
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.