• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    International Conference on Theory and Applications of Satisfiability Testing

    International Conference on Theory and Applications of Satisfiability Testing

    ConferenceCCF 计算机科学理论 B

    年发文量

    研究主题

    论文(1045)

    排序
    1Simplify, Order, Break, Repeat.
    Markus Anders,Cayden R. Codel,Marijn J. H. Heule
    2026引用:1
    引用
    AI阅读
    加入学术空间
    2A Natively Parallel Proof Framework for Clause-Sharing SAT Solving.
    Ruben Götz, Michael Dörr,Dominik Schreiber
    2026
    引用
    AI阅读
    加入学术空间
    3Definition-Based Dependency Schemes.
    David Kattermann, Clemens Hofstadler,Martina Seidl
    2026
    引用
    AI阅读
    加入学术空间
    4Hermax: A Unified MaxSAT Library (tool Paper).
    Josep Maria Salvia Hornos, Cèsar Fernández Camón, Carles Mateu Piñol
    2026
    引用
    AI阅读
    加入学术空间
    5Towards Understanding the Complexity of CAQE: A Proof-Theoretic Analysis of Its Core Procedure.
    Benjamin Böhm,Olaf Beyersdorff

    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 CAQE^𝖢𝗈𝗋𝖾, 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 CAQE^𝖢𝗈𝗋𝖾 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 CAQE^𝖢𝗈𝗋𝖾 proofs, but – with the number of ∃∀ alternations as exponent – as an upper bound as well. Using this analysis, we prove that Q-resolution with an NP oracle simulates CAQE^𝖢𝗈𝗋𝖾 on QCNFs of bounded quantifier alternation. The same holds for QCDCL (Quantified Conflict-Driven Clause Learning, formalised as a proof system) on Σ_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 CAQE^𝖢𝗈𝗋𝖾, where the separation of QCDCL from CAQE^𝖢𝗈𝗋𝖾 uses cube learning.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1045 篇论文

    高被引作者

    作者引用发文
    Niklas Eén56053
    Niklas Sörensson48943
    Armin Biere254345
    Joao Marques-Silva218544
    Marijn J.H. Heule105738
    Fahiem Bacchus97317
    Ines Lynce94617
    Stefan Szeider87239
    Alexey Ignatiev75015
    Laurent Simon70616

    高产作者

    作者引用发文
    Armin Biere254345
    Joao Marques-Silva218544
    Stefan Szeider87239
    Marijn J.H. Heule105738
    Olaf Beyersdorff18922
    Friedrich Slivovsky24720
    Ines Lynce94617
    Fahiem Bacchus97317
    Oliver Kullmann63016
    Laurent Simon70616

    相关期刊

    ACM SIGLOG News
    Conference on Current Trends in Theory and Practice of Informatics
    ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
    Conference on Automated Deduction
    Italian Conference on Computational Logic
    ACM/IEEE Symposium on Logic in Computer Science
    Reachability Problems
    Electronic Proceedings in Theoretical Computer Science (EPTCS)
    Information and Computation
    ACM Transactions on Computational Logic