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
Satisfiability checking of non-clausal formulas using general matings
TL;DR: A new non-clausal SAT-solver based on General Matings instead of DPLL search is presented, able to handle non-Clausal formulas involving ∨,∧,¬ operators without destroying their structure or introducing new variables.
Journal ArticleDOI
Subgoaling techniques for satisficing and optimal numeric planning
TL;DR: Novel subgoaling relaxations for automated planning with propositional and numeric state variables and numeric conditions are studied, with the aim of reaching a good trade-off between accuracy and computation costs within a heuristic state-space search planner.
Understanding and Improving a Modern SAT Solver
TL;DR: This work proposes a framework for presenting and analyzing a modern DLLbased SAT solver, and provides a basic backtracking algorithm that explicitly shows the process of resolution refutation construction and proposes an enhancement to the minimized 1UIP scheme, called local conflict clause recording.
Functional test generation based on word -level satisfiability
TL;DR: Two approaches that enhance the capability of functional test generation by preserving arithmetic operators in the design based on word-level SAT techniques are presented: LPSAT, based on integer linear programming, and CLP-SAT,based on constraint logic programming.
Verification using satisfiability checking, predicate abstraction, and craig interpolation
Edmund M. Clarke,Himanshu Jain +1 more
TL;DR: Two non-clausal SAT algorithms that operate on the Negation Normal Form (NNF) of the given formula are presented, and the utility of the authors' interpolation algorithms for discovering modular/divisibility predicates in a counterexample guided abstraction refinement (CEGAR) framework is 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.