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
Dissertation
Test Generation and Animation Based on Object-Oriented Specifications
TL;DR: This thesis presents clarifications and a partial formalization of the Object Constraint Language (OCL) as well as some extensions in order to allow for test generation and animation based on OCL specifications to take advantage of state-of-the-art satisfiability solving techniques.
Journal ArticleDOI
Application-Specific Bridging Fault Testing of FPGAs
TL;DR: A new technique for testing the interconnects of any arbitrary design mapped into an FPGA is presented, with results showing that only two test configurations are required to test for all bridging faults, achieving 100% fault coverage, with respect to the fault list.
Proceedings ArticleDOI
Board-level multiterminal net assignment
Xiaoyu Song,William N. N. Hung,Alan Mishchenko,Malgorzata Chrzanowska-Jeske,A. Coppola,Andrew Kennings +5 more
TL;DR: The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems and shows that the method is time-efficient and applicable to large layout problem instances.
Book ChapterDOI
Experimenting with look-back heuristics for hard ASP programs
TL;DR: A number of look-back heuristics exploiting peculiarities of ASP and implement them in the ASP system DLV outperforming all of the prominent disjunctive ASP systems - DLV (with its traditional heuristic), GnT, and CModels3 - on many of the instances considered.
Proceedings ArticleDOI
Propelling SAT and SAT-based BMC using careset
TL;DR: It is demonstrated that for a SAT-based bounded model checking (BMC) application the authors can derive it automatically from the sequential behaviors of programs, and lead to a performance improvement over well-known heuristics, and over top-ranked solvers of SAT2009 competition.
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.