Online Estimation of SAT Solving Runtime

DOI10.1007/978-3-540-79719-7_12MaRDI QIDQ3502701zbMATH OpenOpenAlexFDO

Authors Shai Haim, Toby Walsh

Publication date 27 May 2008

Published in Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79719-7_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• SATzilla: portfolio-based algorithm selection for SAT
• Ensemble-based prediction of SAT search behaviour
• A dynamic restart strategy for solving SAT problem
• Algorithm runtime prediction: methods \& evaluation
• Local Restarts

Cited in

(7)

• Online over time processing of combinatorial problems
• MedleySolver: online SMT algorithm selection
• Machine learning for first-order theorem proving
• Portfolio theorem proving and prover runtime prediction for geometry
• Ensemble-based prediction of SAT search behaviour
• A Bayesian approach to tackling hard computational problems. (Preliminary report)
• Algorithm runtime prediction: methods \& evaluation

Describes a project that uses

Uses Software

• MiniSat

This page was built for publication: Online Estimation of SAT Solving Runtime

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