Author:
Beyersdorff Olaf,Blinkhorn Joshua
Publisher
Springer International Publishing
Reference25 articles.
1. Balabanov, V., Jiang, J.R.: Unified QBF certification and its applications. Formal Methods Syst. Des. 41(1), 45–65 (2012)
2. Balabanov, V., Jiang, J.R., Janota, M., Widl, M.: Efficient extraction of QBF (counter)models from long-distance resolution proofs. In: Conference on Artificial Intelligence (AAAI), pp. 3694–3701 (2015)
3. Lecture Notes in Computer Science;V Balabanov,2014
4. Beyersdorff, O., Bonacina, I., Chew, L.: Lower bounds: from circuits to QBF proof systems. In: Proceedings of the ACM Conference on Innovations in Theoretical Computer Science (ITCS 2016), pp. 249–260. ACM (2016)
5. Lecture Notes in Computer Science;O Beyersdorff,2014
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Boolean Functions for QBF Semantics;Lecture Notes in Computer Science;2024
2. Chapter 31. Quantified Boolean Formulas;Frontiers in Artificial Intelligence and Applications;2021-02-02
3. Building Strategies into QBF Proofs;Journal of Automated Reasoning;2020-05-22
4. Dynamic QBF Dependencies in Reduction and Expansion;ACM Transactions on Computational Logic;2020-04-30
5. Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths;Theory and Applications of Satisfiability Testing – SAT 2020;2020