跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19613 · v1

Towards Understanding the Complexity of CAQE: A Proof-Theoretic Analysis of its Core Procedure

首次提交 2026-11-15 04:43
版本更新 2026-11-15 04:43
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

CAQE (Clausal Abstraction for Quantifier Elimination) is currently the most successful algorithmic paradigm for solving Quantified Boolean Formulas (QBF) in practice, clearly dominating recent QBF competitions. While apparently being a very strong solver, not much is known about CAQE in theory. We propose a framework for formalising runs of the basic CAQE algorithm (where failed assumptions are not considered) as proofs in a proof system CAQECore^{\mathsf{Core}}, which we use to analyse the algorithm proof-theoretically and which provides methods for future work to separate it from optimised versions of CAQE that are used in practice. We show that one can perform strategy extraction on the CAQECore^{\mathsf{Core}} proof system in such a way that strategy size serves as a lower bound for basic CAQE runs. Furthermore, we introduce a measure, which we call CAQE width, which not only acts as a lower bound on CAQECore^{\mathsf{Core}} proofs, but -- with the number of ∃∀\exists\forall alternations as exponent -- as an upper bound as well. Using this analysis, we prove that Q-resolution with an NP oracle simulates CAQECore^{\mathsf{Core}} on QCNFs of bounded quantifier alternation. The same holds for QCDCL (Quantified Conflict-Driven Clause Learning, formalised as a proof system) on Σ3bΣ_3^b QCNFs when purely propositional CDCL steps are not counted, after a simple preprocessing step. In this setting, both systems are indeed strictly stronger than CAQECore^{\mathsf{Core}}, where the separation of QCDCL from CAQECore^{\mathsf{Core}} uses cube learning.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 04:43 · 最新观测版本

Towards Understanding the Complexity of CAQE: A Proof-Theoretic Analysis of its Core Procedure

CAQE (Clausal Abstraction for Quantifier Elimination) is currently the most successful algorithmic paradigm for solving Quantified Boolean Formulas (QBF) in practice, clearly dominating recent QBF competitions. While apparently being a very strong solver, not much is known about CAQE in theory. We propose a framework for formalising runs of the basic CAQE algorithm (where failed assumptions are not considered) as proofs in a proof system CAQECore^{\mathsf{Core}}, which we use to analyse the algorithm proof-theoretically and which provides methods for future work to separate it from optimised versions of CAQE that are used in practice. We show that one can perform strategy extraction on the CAQECore^{\mathsf{Core}} proof system in such a way that strategy size serves as a lower bound for basic CAQE runs. Furthermore, we introduce a measure, which we call CAQE width, which not only acts as a lower bound on CAQECore^{\mathsf{Core}} proofs, but -- with the number of ∃∀\exists\forall alternations as exponent -- as an upper bound as well. Using this analysis, we prove that Q-resolution with an NP oracle simulates CAQECore^{\mathsf{Core}} on QCNFs of bounded quantifier alternation. The same holds for QCDCL (Quantified Conflict-Driven Clause Learning, formalised as a proof system) on Σ3bΣ_3^b QCNFs when purely propositional CDCL steps are not counted, after a simple preprocessing step. In this setting, both systems are indeed strictly stronger than CAQECore^{\mathsf{Core}}, where the separation of QCDCL from CAQECore^{\mathsf{Core}} uses cube learning.

查看此版本解读 →查看此版本原文 ↗