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
Local Rapid Learning for Integer Programs
TL;DR: Rapid Learning as discussed by the authors is a hybrid CP/MIP approach where CP search is applied at the root to learn information to support the remaining MIP solve, but strong conflict information is typically gained by depth-first search.
Journal ArticleDOI
A SAT-based approach to cost-sensitive temporally expressive planning
TL;DR: This article proposes a scheme to translate a CSTE planning problem to a minimum cost (MinCost) satisfiability (SAT) problem and to integrate with a relaxed parallel planning semantics for handling true temporal expressiveness, and develops a C STE customized variable branching scheme for BB-CDCL which can significantly improve the search efficiency.
Proceedings ArticleDOI
A SAT-based Timing Driven Place and Route Flow for Critical Soft IP
Henri Fraisse,Dinesh D. Gaitonde +1 more
TL;DR: This paper proposes a timing-driven Place and Route flow based on Boolean Satisfiability (SAT), its main advantages over previous SAT-based approaches are its improved scalability and its timing awareness.
Extending SAT Solver with Parity Reasoning
TL;DR: This work studies how CDCL SAT solvers can be enhanced to handle problems with parity constraints using the recently introduced DPLL(XOR) framework where the SAT solver is coupled with a parity constraint solver module.
Book ChapterDOI
Parallel Maximum Satisfiability
TL;DR: This chapter provides an overview of the state of the art in parallel Maximum Satisfiability, including characteristics of the different MaxSAT algorithms and conditions for safe clause sharing.
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.