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
The Satisfiability Problem- From The Theory of NP-completeness to State-Of-The-Art SAT Solvers
TL;DR: SAT is introduced through the theory of NP-completeness, and a broad overview of the different techniques and algorithms used to solve the SAT problem is followed, noting that given vast amount of algorithms that have been proposed only the classical and most prominent are discussed.
Dissertation
Fragments de l'arithmétique dans une combinaison de procédures de décision
TL;DR: La derniere partie of the these presente une variation incrementale originale de la methode du simplexe que nous utilisons pour construire une procedure of decision pour l'arithmetique lineaire.
Journal Article
Formula Caching in DPLL.
TL;DR: A natural and implementable form of DPLL with caching, FCWreason, which is surprisingly powerful: it can polynomially simulate regular resolution, and furthermore, it can produce short proofs of some formulas that require exponential-size resolution proofs.
Journal ArticleDOI
Hybrid optimization of vehicle routing problems
TL;DR: This dissertation presents two applications relevant to industry and develops a fully hybrid method, named Branch-and-Check with Explanations, that unifies linear programming, constraint programming and Boolean satisfiability for solving a classical vehicle routing problem.
Du Glucose en goutte à goutte pour les coeurs inconsistants
TL;DR: In this paper, the notion de qualité de clauses apprises dans le case intensif de démonstrateur incrémental utilisant des hypothèses.
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.