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
Identification et exploitation d'états partiels
TL;DR: In this article, the authors propose an etude concernant l'identification and l'exploitation des etats partiels inconsistants (IPS) dans le cadre de la resolution du probleme de satisfaction de contraintes (CSP).
Limit Crossing for Decision Problems
Sharlee Climer,Weixiong Zhang +1 more
TL;DR: The use of limit crossing is demonstrated in the design of a tool for identifying K-SAT backbones that is guaranteed to identify all of the backbone variables by solving at most n + 1 formulae, where n is the total number of variables.
Book ChapterDOI
Lemma learning in SMT on linear constraints
Yinlei Yu,Sharad Malik +1 more
TL;DR: Methods of efficient lemma learning on SMT problems with linear real/integer arithmetic constraints are proposed and a static learning technique that analyzes the relationship of the linear constraints is described, which can be expanded to many other theories.
Journal Article
A Review on Multicore Architecture and their Validation
Ramalakshmi. R,Rajamunipriya. R +1 more
Learning Techniques for Pseudo-Boolean Solving and Optimization
TL;DR: This work presents a contribution by providing an exhaustive comparitive study between several learning schemes in a common platform, to build an “instance aware” PB solver that takes advantage of all different learning schemes.
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.