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
SAT, SMT, and QBF Solving in a Multi-Core Environment
Bernd Becker,Tobias Schubert +1 more
TL;DR: Recent trends in hardware design towards multi-core and multiprocessor systems call for the development of dedicated parallel algorithms in order to exploit the full potential of these architectures.
Dissertation
Fouille de données par contraintes
TL;DR: In this article, the authors propose an encodage base on the satisfiabilite propositionnelle to solve the problem of clustering a set of formules propositionnelles without avoir besoin d a representation explicite de leurs modeles.
Enhancing Reasoning with the Extension Rule in CDCL SAT Solvers
TL;DR: Experiments carried out on the 2018 SAT competition's benchmarks show the use of the extension rule in CDCL SAT solvers to be practically useful for both satisfiable and unsatisfiable instances.
Dissertation
Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones
TL;DR: In this paper, a methode complete for solving the problem of satisfaisabilite (SAT) is introduced, which eliminates toutes les symetries locales for the resolution of the problem.
Proceedings ArticleDOI
PICHAFF² — A Hierarchical Parallel SAT Solver
Tobias Schubert,Bernd Becker +1 more
TL;DR: A novel work stealing scheme is proposed, which is able to manage multiple of these multiprocessor cards in parallel and point out the efficiency of the approach by a set of experiments.
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.