Funder
John Templeton Foundation
European Commission Research Executive Executive Agency
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference45 articles.
1. Bacchus, F., Walsh, T. (eds.): International conference on theory and practice of satisfiability testing (SAT), Lecture notes in computer science, vol. 3569. Springer, Berlin (2005)
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. Balabanov, V., Widl, M., Jiang, J.R.: QBF resolution systems and their proof complexities. In: Sinz, C., Egly, U. (eds.) International conference on theory and applications of satisfiability testing (SAT), Lecture notes in computer science, vol. 8561, pp. 154–169. Springer (2014)
4. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. ACM 48(2), 149–169 (2001)
5. Benedetti, M., Mangassarian, H.: QBF-based formal verification: Experience and perspectives. Journal on Satisfiability Boolean Modeling and Computation (JSAT) 5(1–4), 133–191 (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hard QBFs for Merge Resolution;ACM Transactions on Computation Theory;2023-12-22
2. A simple proof of QBF hardness;Information Processing Letters;2021-06
3. Proof Complexity of Symbolic QBF Reasoning;Theory and Applications of Satisfiability Testing – SAT 2021;2021