Publisher
Springer Nature Switzerland
Reference17 articles.
1. Balabanov, V., Jiang, J.R.: Unified QBF certification and its applications. Formal Methods Syst. Des. 41(1), 45–65 (2012)
2. Beyersdorff, O., Chew, L., Janota, M.: New resolution-based QBF calculi and their proof complexity. ACM Trans. Comput. Theory 11(4), 26:1–26:42 (2019)
3. Beyersdorff, O., Janota, M., Lonsing, F., Seidl, M.: Quantified Boolean formulas. In: Handbook of Satisfiability - Second Edition, pp. 1177–1221. IOS Press (2021)
4. Lecture Notes in Computer Science;O Beyersdorff,2021
5. Böhm, B., Peitl, T., Beyersdorff, O.: Should decisions in QCDCL follow prefix order? In: SAT. LIPIcs, vol. 236, pp. 11:1–11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献