Olaf Beyersdorff

Recent Publications

Hard QBFs for Merge Resolution
ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1–6:24, 2024.
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 1781–1787, 2022, ijcai.org.
Note: Distinguished Paper Award
Should Decisions in QCDCL Follow Prefix Order?
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hard QBFs for Merge Resolution
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena and Sunil Simon), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag.