QRAT Polynomially Simulates $$\forall \text {-Exp+Res}$$-Reference-Cited by-同舟云学术

QRAT Polynomially Simulates $$\forall \text {-Exp+Res}$$

Published:2019 Issue: Volume: Page:193-202
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kiesl Benjamin,Seidl Martina

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-24258-9_13

Reference28 articles.

1. Balabanov, V., Jiang, J.R.: Unified QBF certification and its applications. Formal Methods Syst. Des. 41(1), 45–65 (2012)

2. Lecture Notes in Computer Science;V Balabanov,2014

3. Beyersdorff, O., Bonacina, I., Chew, L.: Lower bounds: from circuits to QBF proof systems. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (ITCS 2016), pp. 249–260. ACM (2016)

4. Lecture Notes in Computer Science;O Beyersdorff,2014

5. Beyersdorff, O., Chew, L., Janota, M.: Proof complexity of resolution-based QBF calculi. In: Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). LIPIcs, vol. 30, pp. 76–89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Uniform Certification in QBF;Logical Methods in Computer Science;2024-02-13

2. Never Trust Your Solver: Certification for SAT and QBF;Lecture Notes in Computer Science;2023

3. Hardness and Optimality in QBF Proof Systems Modulo NP;Theory and Applications of Satisfiability Testing – SAT 2021;2021

4. How QBF Expansion Makes Strategy Extraction Hard;Automated Reasoning;2020