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
A Study of Implication Based Pseudo Functional Testing
M. Syal,Kameshwar Chandrasekar,V.C. Vimjam,Michael S. Hsiao,Yi-Shing Chang,Sreejit Chakravarty +5 more
TL;DR: The evaluation of the functional constraints on large industrial circuits show that the proposed constraint generation algorithm generate a powerful set of constraints most of which are not captured in the constraints extracted by designers for design-verification purposes.
BookDOI
Iterating transducers in the large
TL;DR: Find that existing generic techniques are often not applicable in cases easily handled by specific techniques, a new approach to iterating transducers is developed, which exploits a number of new conceptual and algorithmic ideas.
Journal ArticleDOI
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
TL;DR: In this article, the authors compare the effect of the delayed theory combination (DTC) procedure on the SAT solver and the number of deduction and case-splitting operations.
Proceedings ArticleDOI
Efficient Preimage Computation Using A Novel Success-Driven ATPG
Shuo Sheng,Michael S. Hsiao +1 more
TL;DR: This work presents a novel success-driven learning algorithm which significantly accelerates an ATPG engine for enumerating all solutions (preimages) and effectively prunes redundant search space due to overlapped solutions and constructs a free BDD on the fly so that it becomes the representation of the preimage set at the end.
Book ChapterDOI
Partitioning SAT instances for distributed solving
TL;DR: New methods for constructing partitions which combine clause learning and lookahead are presented and their performance is demonstrated with an extensive comparison against the best sequential solvers in the SAT competition 2009 as well as against two efficient parallel solvers.
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.