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
Journal ArticleDOI
A logic-based Benders decomposition for microscopic railway timetable planning
TL;DR: In this paper , a logic Benders decomposition approach is proposed to solve the problem of railway timetable planning, which exploits the typical structure of a railway with dense networks around major hubs and sparse connections in between hubs.
Book ChapterDOI
Beyond unit propagation in SAT solving
Michael Kaufmann,Stephan Kottler +1 more
TL;DR: Two approaches are presented on how to extend the broadly applied Unit Propagation technique where a variable assignment is implied iff a clause has all but one of its literals assigned to false.
Property Checking with Constraint Integer Programming
TL;DR: This work addresses the property checking problem for SoC design verification at the register transfer level (RTL) by integrating techniques from integer programming, constraint programming, and SAT solving, and shows that this approach outperforms SAT techniques for proving the validity of properties on circuits containing arithmetics.
Journal ArticleDOI
Substitutions into propositional tautologies
TL;DR: It is proved that there is a polynomial time substitution (y"1,...,y"n) with k@?n such that whenever the substitution instance A(g(x"1)...,x"k)) of a 3DNF formula A(y" 1,..., y" n) has a short resolution proof it follows that A(Y"1...),y'n is a tautology.
Space in Proof Complexity
TL;DR: This thesis is concerned with the size and space of proofs, and in parti the study of the resources that are needed to prove formulas in propositional logic.
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.