The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
SATzilla: Portfolio-based Algorithm Selection for SAT
Open accessAbstract
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 three gold, one silver and one bronze medal. In this article, we go well beyond SATzilla07 by making the portfolio construction scalable and completely automated, and improving it 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. We demonstrate the effectiveness of these new techniques in extensive experimental results on data sets including instances from the most recent SAT competition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
(2006) · Springer eBooks · Cited by 8,123
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
Pattern recognition and machine learning
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5091 · Cited by 2,650
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
Guyon, I., Gunn, S., Nikravesh, M., & Zadeh, L. A. (2006) · Springer eBooks · Cited by 1,845
Feature extraction : foundations and applications
Guyon, I., Gunn, S. R., Nikravesh, M., & zadeh, L. N. (2006) · Cited by 1,658
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
Self-citationThe Algorithm Selection Problem
Rice, J. R. (1976) · Advances in Computers · doi:10.1016/s0065-2458(08)60520-3 · Cited by 1,195
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
The bayes net toolbox for matlab
Murphy, K. (2001) · Cited by 1,014
Sparse multinomial logistic regression: fast algorithms and generalization bounds
Krishnapuram, B., Carin, L., Figueiredo, M. A. T., & Hartemink, A. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.127 · Cited by 877
Pushing the envelope: planning, propositional logic, and stochastic search
Kautz, H., & Selman, B. (1996) · Cited by 830
Noise strategies for improving local search
Selman, B., Kautz, H., & Cohen, B. (1994) · Cited by 757
Symbolic model checking using SAT procedures instead of BDDs
Biere, A., Cimatti, A., Clarke, E. M., Fujita, M., & Zhu, Y. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.309942 · Cited by 752
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001) · Cited by 682
Gomes, C. P., & Selman, B. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00081-3 · Cited by 461
Unifying SAT-based and graph-based planning
Kautz, H., & Selman, B. (1999) · Cited by 429
An Economics Approach to Hard Computational Problems
Huberman, B. A., Lukose, R. M., & Hogg, T. (1997) · Science · doi:10.1126/science.275.5296.51 · Cited by 390
Combinational test generation using satisfiability
Stephan, P., Brayton, R. K., & Sangiovanni-Vincentelli, A. L. (1996) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.536723 · Cited by 326
The Quest for Efficient Boolean Satisfiability Solvers
Zhang, L., & Malik, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_2 · Cited by 279
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
Hutter, F., Tompkins, D. A. D., & Hoos, H. H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46135-3_16 · Cited by 204
Self-citationUnderstanding Random SAT: Beyond the Clauses-to-Variables Ratio
Nudelman, E., Leyton-Brown, K., Hoos, H. H., Devkar, A., & Shoham, Y. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30201-8_33 · Cited by 183
Self-citationZchaff2004: An Efficient SAT Solver
Mahajan, Y. S., Fu, Z., & Malik, S. (2005) · Lecture notes in computer science · doi:10.1007/11527695_27 · Cited by 147
Diversification and Determinism in Local Search for Satisfiability
Li, C.-M., & Huang, W. Q. (2005) · Lecture notes in computer science · doi:10.1007/11499107_12 · Cited by 129
A portfolio approach to algorithm select
Leyton‐Brown, K., Nudelman, E., Andrew, G., McFadden, J., & Shoham, Y. (2003) · International Joint Conference on Artificial Intelligence · Cited by 128
Self-citationPerformance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Hutter, F., Hamadi, Y., Hoos, H. H., et al. (2006) · Lecture notes in computer science · doi:10.1007/11889205_17 · Cited by 125
Self-citationA Bayesian Approach to Tackling Hard Computational ProblemsPreprint
Horvitz, E., Ruan, Y., Gomes, C. P., Kautz, H., Selman, B., & Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2279 · Cited by 114
SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
Xu, L. H., Hutter, F., Hoos, H. H., & Leyton‐Brown, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-74970-7_50 · Cited by 109
Self-citationLearning dynamic algorithm portfolios
Gagliolo, M., & Schmidhuber, J. (2007) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-006-9036-z · Cited by 107
Samulowitz, H., & Memisevic, R. (2007) · Cited by 79
Combining multiple heuristics online
Streeter, M. J. V., Golovin, D., & Smith, S. F. (2007) · Cited by 72
APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS
Carchrae, T., & Beck, J. C. (2005) · Computational Intelligence · doi:10.1111/j.1467-8640.2005.00278.x · Cited by 67
Boosting as a Metaphor for Algorithm Design
Leyton‐Brown, K., Nudelman, E., Andrew, G., McFadden, J., & Shoham, Y. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45193-8_75 · Cited by 57
Self-citationImpact of Censored Sampling on the Performance of Restart Strategies
Gagliolo, M., & Schmidhuber, J. (2006) · Lecture notes in computer science · doi:10.1007/11889205_14 · Cited by 12
Cited by
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
Self-citationHyperparameter optimization: Foundations, algorithms, best practices, and open challenges
Bischl, B., Binder, M., Lang, M., Pielok, T., Richter, J., Coors, S., Thomas, J., Ullmann, T., Becker, M., Boulesteix, A., et al. (2023) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1484 · Cited by 930
ParamILS: An Automatic Algorithm Configuration Framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stuetzle, T. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2861 · Cited by 882
Self-citationPotassco: The Potsdam Answer Set Solving Collection
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. (2011) · AI Communications · doi:10.3233/aic-2011-0491 · Cited by 456
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Self-citation
Metadata
- Authors
- Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2008-07-01
- Volume
- 32
- Pages
- 565-606
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2147148915
- Cited by
- 857
- References
- 36
- FWCI
- 56.51
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.