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
Proceedings ArticleDOI
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets
Stefan Disch,C. Schollm +1 more
TL;DR: This paper focuses on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking and presents heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked.
Proceedings ArticleDOI
Optimization-intensive watermarking techniques for decision problems
TL;DR: This paper demonstrates, by example of the Boolean satisfiability (SAT) problem, how one can select a subset of superimposed watermarking constraints so that the uniqueness of the signature and the likelihood of satisfying the satisfiability problem are simultaneously maximized.
Book ChapterDOI
SBSAT: a State-Based, BDD-Based Satisfiability Solver
John Franco,Michal Kouril,John S. Schlipf,Jeffrey Ward,Sean A. Weaver,Michael R. Dransfield,W. Mark Vanfleet +6 more
TL;DR: A new approach to SAT solvers is presented, supporting efficient implementation of highly sophisticated search heuristics over a range of propositional inputs, including CNF formulas, but particularly sets of arbitrary boolean constraints, represented as BDDs.
Journal ArticleDOI
Producing and verifying extremely large propositional refutations
TL;DR: This paper reports on a tool that has verified proofs more than 1600 gigabytes long and develops a practical system for formal verification of a more compact certificate format called RUP, an extension of conflict-clause proofs introduced by Goldberg and Novikov, and is compatible with conflict-Clause minimization.
Proceedings ArticleDOI
Test automation for hybrid systems
TL;DR: Novel results on automated test generation for hybrid control systems, which involves the generation of both discrete and real-valued, potentially time-continuous, input data to the system under test, are presented.
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.