Width-Based Restart Policies for Clause-Learning Satisfiability Solvers

Authors:
Knot Pipatsrisawat;Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles, USA;Computer Science Department, University of California, Los Angeles, USA
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 18
Cited 3

Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Short proofs are narrow—resolution made simple

Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica
Calysto: scalable and precise extended static checking

Proceedings of the 30th international conference on Software engineering
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
The effect of restarts on the efficiency of clause learning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A lightweight component caching scheme for satisfiability solvers

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Structural abstraction of software verification conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A case for simple SAT solvers

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Adaptive restart strategies for conflict driven SAT solvers

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Local restarts

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Zchaff2004: an efficient SAT solver

SAT'04 Proceedings of the 7th 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
On freezing and reactivating learnt clauses

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Intensification search in modern SAT solvers

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new class of restart policies, called width-based policies, for modern clause-learning SAT solvers. The new policies encourage the solvers to find refutation proofs with small widths by determining restarting points based on the sizes of conflict clauses learned rather than the number of conflicts experienced by the solvers. We show that width-based restart policies can outperform traditional restart policies on some special classes of SAT problems. We then propose different ways of adjusting the width parameter of the policies. Our experiment on industrial problems shows that width-based policies are competitive with the restart policy used by many state-of-the-art solvers. Moreover, we find that the combination of these two types of restart policies yields improvements on many classes of problems.