| Understanding the relative strength of QBF CDCL solvers and QBF resolution O Beyersdorff, B Böhm Logical Methods in Computer Science 19, 2023 | 14 | 2023 |
| Lower bounds for QCDCL via formula gauge B Böhm, O Beyersdorff Journal of Automated Reasoning 67 (4), 35, 2023 | 7 | 2023 |
| Should decisions in QCDCL follow prefix order? B Böhm, T Peitl, O Beyersdorff Journal of Automated Reasoning 68 (1), 5, 2024 | 5 | 2024 |
| QCDCL with cube learning or pure literal elimination-what is best? B Böhm, T Peitl, O Beyersdorff IJCAI, 1781-1787, 2022 | 5 | 2022 |
| QCDCL vs QBF resolution: Further insights B Böhm, O Beyersdorff 26th International Conference on Theory and Applications of Satisfiability …, 2023 | 2 | 2023 |
| Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs O Beyersdorff, B Böhm, M Mahajan Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 7943-7951, 2024 | | 2024 |
| 3.6 CDCL vs resolution: the picture in QBF B Böhm Theory and Practice of SAT and Combinatorial Solving, 94, 0 | | |
