QCDCL vs QBF resolution: further insights

DOI10.4230/LIPICS.SAT.2023.4MaRDI QIDQ6643076zbMATH OpenFDO

Authors Benjamin Böhm, Olaf Beyersdorff

Publication date 26 November 2024

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

zbMATH Keywords

CDCLlower boundsproof complexityQBFresolutionsimulations

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)

Cited in

(2)

• Runtime vs. extracted proof size: an exponential gap for CDCL on QBFs
• Dependency schemes in CDCL-based QBF solving: a proof-theoretic study

This page was built for publication: QCDCL vs QBF resolution: further insights

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