Revisiting satzilla features in 2024

DOI10.4230/LIPICS.SAT.2024.27MaRDI QIDQ6864412zbMATH OpenFDO

Authors Hadar Shavit, Holger H. Hoos

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.27

zbMATH Keywords

feature extractionrunning time predictionsatisfiabilitysatisfiability prediction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Algorithm runtime prediction: methods \& evaluation
• Controlling a solver execution with the runsolver Tool
• Empirical hardness models, methodology and a case study on combinatorial auctions
• Principles and Practice of Constraint Programming – CP 2004
• SATzilla: portfolio-based algorithm selection for SAT
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
• Theory and Applications of Satisfiability Testing

Cited in

(1)

• Probing features for automatic algorithm selection for pseudo-Boolean optimization

This page was built for publication: Revisiting satzilla features in 2024

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864412)