Optimal speedup of Las Vegas algorithms
Information Processing Letters
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Eighteenth national conference on Artificial intelligence
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Restart Strategy Selection Using Machine Learning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Diversification and intensification in parallel SAT solving
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SAT solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Off the trail: re-examining the CDCL algorithm
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Intensification search in modern SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Refining restarts strategies for SAT and UNSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Factoring out assumptions to speed up MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
As the SAT competition has shown, frequent restarts improve the speed of SAT solvers tremendously, particularly on satisfiable industrial instances. This paper presents a novel adaptive technique that measures the agility of the search process dynamically, which in turn is used to control the restart frequency. Experiments demonstrate, that this new dynamic restart strategy improves speed of our SAT solver PicoSAT on crafted instances considerably and on industrial instances slightly.