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
Deterministic Parallel DPLL (DP2LL)
TL;DR: This paper proposes the first Deterministic Parallel DPLL engine, based on a state-of-the-art parallel portfolio architecture and relies on a controlled synchronizing of the different threads, which preserves the performance of the parallel portfolio approach while ensuring full reproducibility of the results.
A SAT-based tool for solving configuration problems
TL;DR: The tool is implemented in Java and encodes the constrains of every configuration problem into a propositional formula (an instance of the SAT problem) which can be solved by a SAT solver, solving the satisfiability of the formulas encoded from the constraints defined in the configuration problems.
SHIVA – A Fast Hybrid Constraint Solver for Circuits
TL;DR: The design and implementation of SATORI – a fast sequential justification engine based on state-of-theart SAT and ATPG techniques and use conflict-based learning in each time-frame and illegal state learning across time-frames are described.
Journal ArticleDOI
Analyzing Multiple Conflicts in SAT: An Experimental Evaluation
TL;DR: In this paper , the authors report on their experience in modifying this concrete aspect in the CaDiCaL SAT Solver and try to answer the question of whether they can improve the performance of SAT Solvers by the analysis of multiple conflicts.
Proceedings ArticleDOI
SAT with Global Constraints
TL;DR: A tight integration of SAT with CP is presented, called SAT(gc), which embeds global constraints into SAT, and a prototype is implemented by integrating the state of the art SAT solver ZCHAFF and the generic constraint solver GECODE.
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.