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
Simultaneous SAT-Based model checking of safety properties
TL;DR: Several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties focus on Bounded Model Checking and Temporal Induction methods for simultaneously verifying multiple safety properties on the same model.
Book ChapterDOI
Program Synthesis Using Deduction-Guided Reinforcement Learning
TL;DR: A new variant of the policy gradient algorithm that can incorporate feedback from a deduction engine into the underlying statistical model is proposed that combines the power of deductive and statistical reasoning in a unified framework.
Journal ArticleDOI
Local consistency and SAT-solvers
Peter Jeavons,Justyna Petke +1 more
TL;DR: In this paper, the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which is called negative-hyper-resolution, on the standard direct encoding of the problem into Boolean clauses.
Journal ArticleDOI
Segmented channel routability via satisfiability
TL;DR: This paper encodes the horizontal and vertical constraints of the routing problem as Boolean conditions and shows that the routability constraint is satisfiable if and only if the net connections in the segmented channel are routable.
Journal ArticleDOI
SymChaff: exploiting symmetry in a structure-aware satisfiability solver
TL;DR: This article presents a new low-overhead framework for representing and utilizing problem symmetry in propositional satisfiability algorithms by using high level problem description to pass on symmetry information to the SAT solver in a simple and concise 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.