Active learning for SAT solver benchmarking. Extended and revised version

DOI10.1007/S10817-025-09729-6MaRDI QIDQ6957138zbMATH OpenFDO

Authors Tobias Fuchs, Jakob Bach, Markus Iser

Publication date 16 July 2025

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10817-025-09729-6

zbMATH Keywords

active learningbenchmark selectionpropositional satisfiability

Mathematics Subject Classification ID

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

Cites work

• \textsc{Alors}: an algorithm recommender system
• Careful ranking of multiple solvers with timeouts and ties
• Comparing two \(K\)-category assignments by a \(K\)-category correlation coefficient
• Global benchmark database
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• On the performance of deep generative models of realistic SAT instances
• Random forests
• SAT competition 2020
• SATzilla: portfolio-based algorithm selection for SAT
• Scikit-learn: machine learning in Python
• Solving SAT in a distributed cloud: a portfolio approach

This page was built for publication: Active learning for SAT solver benchmarking. Extended and revised version

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