SATzilla: Portfolio-based Algorithm Selection for SAT
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown

TL;DR
SATzilla is an automated, portfolio-based SAT solver selection system that uses empirical hardness models to choose the best solver for each instance, significantly improving performance and scalability.
Contribution
This work introduces scalable, fully automated portfolio construction for SATzilla, integrating local search solvers, performance score prediction, and hierarchical hardness models.
Findings
SATzilla outperforms individual solvers on diverse SAT instances.
The new techniques improve scalability and prediction accuracy.
SATzilla achieved top results in the 2007 SAT Competition.
Abstract
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers. This approach takes as input a distribution of problem instances and a set of component solvers, and constructs a portfolio optimizing a given objective function (such as mean runtime, percent of instances solved, or score in a competition). The excellent performance of SATzilla was independently verified in the 2007 SAT Competition, where our SATzilla07 solvers won…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
