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
An Extensible SAT-solver
Niklas Een,Niklas Sörensson +1 more
TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
SATzilla: portfolio-based algorithm selection for SAT
TL;DR: SATzilla is described, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers and is improved by integrating local search solvers as candidate solvers, by predicting performance score instead of runtime, and by using hierarchical hardness models that take into account different types of SAT instances.
Journal ArticleDOI
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
TL;DR: Extensive experimental evidence shows that DPLL(T) systems can significantly outperform the other state-of-the-art tools, frequently even in orders of magnitude, and have better scaling properties.
Book ChapterDOI
Satisfiability Modulo Theories
Clark Barrett,Cesare Tinelli +1 more
TL;DR: The architecture of a lazy SMT solver is discussed, examples of theory solvers are given, how to combine such solvers modularly is shown, and several extensions of the lazy approach are mentioned.
References
More filters
Proceedings Article
Combining local search and backtracking techniques for constraint satisfaction
Jian Zhang,Hantao Zhang +1 more
TL;DR: This research combines the backtracking and local search techniques into a single method for solving SAT and CSPs and finds that if the parameter takes values in the middle of the two extremes, the new method is much more effective than either backtracking or local search.
Journal ArticleDOI
Coloration Neighbourhood Search With Forward Checking
TL;DR: Good results are obtained; in particular, one variant finds improved colourings on geometric graphs, while another is very effective on equipartite graphs, and its application to other combinatorial problems is discussed.
Proceedings ArticleDOI
Three mechanisms for managing resource constraints in a library for constraint-based scheduling
TL;DR: Each of the three mechanisms is useful, as the time-table and disjunctive mechanisms enable the expression of wider classes of constraints, while edge-finding is in general the most effective in pruning the search space.
Proceedings Article
Dealing with uncertainty when managing an earth observation satellite
TL;DR: In this paper, a mathematical approach, drawn from the Markov Decision Process framework, allows us to define a rational way of taking in account this uncertainty in the daily optimization process, which is the main origin of uncertainty when managing earth optical observation satellites.
Book ChapterDOI
Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View
TL;DR: This paper presents some lessons that can be drawn from trying to model and to solve as best as possible the mission management problem for the new generation of agile Earth observation satellites, that is the selection and the scheduling of observations performed by the satellite.