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
Book ChapterDOI
On freezing and reactivating learnt clauses
TL;DR: A new dynamic management policy of the learnt clause database in modern SAT solvers is proposed, based on a dynamic freezing and activation principle of the learned clauses, that activates the most promising learnt clauses while freezing irrelevant ones.
Proceedings Article
The backdoor key: a path to understanding problem hardness
TL;DR: Empirical studies are described that show that the key faction, i.e., the ratio of the key size to the corresponding backdoor size, is a good predictor of problem hardness of ensembles and individual instances within an ensemble for structure domains with large key fraction.
Journal ArticleDOI
The SAT2002 Competition
TL;DR: The results of the SAT Competition 2002 are given, the interpretations are tried, and suggestions for future competitions are given.
Book ChapterDOI
Diversification and intensification in parallel SAT solving
TL;DR: This paper defines two roles for the computational units, and develops an original intensification strategy which outperforms the best parallel SAT solver ManySAT, and solves some open SAT instances.
Proceedings Article
Advanced conflict-driven disjunctive answer set solving
TL;DR: Novel characterizations of answer sets and unfounded sets are developed allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks, resulting in the new multithreaded disjunctive ASP solver claspD-2.
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.