2023W

• Algorithmics / 186.814 / VU

2024S

• Algorithms and Data Structures / 186.866 / VU
• Seminar on Algorithms / 186.182 / SE
• Structural Decompositions and Algorithms / 186.856 / VU

• From QBF to DQBF: Theory together with Practice
  2021 – 2022 / Austrian Science Fund (FWF)
  Publications: 154458 / 193563

• Are hitting formulas hard for resolution? / Peitl, T., & Szeider, S. (2023). Are hitting formulas hard for resolution? Discrete Applied Mathematics, 337, 173–184. https://doi.org/10.1016/j.dam.2023.05.003
  Download: PDF (732 KB)
  Project: REVEAL-AI (2020–2024)
• A SAT Solver's Opinion on the Erdos-Faber-Lovász Conjecture / Kirchweger, M., Peitl, T., & Szeider, S. (2023). A SAT Solver’s Opinion on the Erdos-Faber-Lovász Conjecture. In M. Mahajan (Ed.), 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023) (pp. 1–17). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2023.13
  Download: PDF (651 KB)
  Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024)
• Hardness Characterisations and Size-width Lower Bounds for QBF Resolution / Beyersdorff, O., Blinkhorn, J., Mahajan, M., & Peitl, T. (2023). Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Transactions on Computational Logic, 24(2), Article 10. https://doi.org/10.34726/3603
  Download: Posted for your personal use. Not for redistribution. (631 KB)
  Project: From QBF to DQBF: Theory together with Practice (2021–2022)
• Hard QBFs for merge resolution / Beyersdorff, O., Blinkhorn, J., Mahajan, M., Peitl, T., & Sood, G. (2023). Hard QBFs for merge resolution. ACM Transactions on Computation Theory. https://doi.org/10.1145/3638263
  Project: From QBF to DQBF: Theory together with Practice (2021–2022)
• Co-Certificate Learning with SAT Modulo Symmetries / Kirchweger, M., Peitl, T., & Szeider, S. (2023). Co-Certificate Learning with SAT Modulo Symmetries. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 1944–1953). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/216
• Long-Distance Q-Resolution with Dependency Schemes / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Long-Distance Q-Resolution with Dependency Schemes. Journal of Automated Reasoning, 63(1), 127–155. https://doi.org/10.1007/s10817-018-9467-3
• Advanced dependency analysis for QBF / Peitl, T. (2019). Advanced dependency analysis for QBF [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.71708
  Download: PDF (3.47 MB)
• Dependency Learning for QBF / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Dependency Learning for QBF. Journal of Artificial Intelligence Research, 65, 181–208. https://doi.org/10.1613/jair.1.11529
• Proof Complexity of Fragments of Long-Distance Q-Resolution / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Proof Complexity of Fragments of Long-Distance Q-Resolution. In Lecture Notes in Computer Science. Theory and Application of Satisfiability Testing -- SAT, Guangzhou, Non-EU. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-24258-9
• Combining Resolution-Path Dependencies with Dependency Learning / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Combining Resolution-Path Dependencies with Dependency Learning. In Lecture Notes in Computer Science. Int. Conference on Theory and Applications of Satisfiability Testing, Trento, EU. LNCS. https://doi.org/10.1007/978-3-030-24258-9
• Polynomial-Time Validation of QCDCL Certificates / Peitl, T., Slivovsky, F., & Szeider, S. (2018). Polynomial-Time Validation of QCDCL Certificates. In O. Beyersdorff & C. M. Wintersteiger (Eds.), Theory and Applications of Satisfiability Testing – SAT 2018 (pp. 253–269). Springer-Verlag, Lecture Notes in Artificial Intelligence 8268. https://doi.org/10.1007/978-3-319-94144-8_16
• Portfolio-Based Algorithm Selection for Circuit QBFs / Hoos, H. H., Peitl, T., Slivovsky, F., & Szeider, S. (2018). Portfolio-Based Algorithm Selection for Circuit QBFs. In Lecture Notes in Computer Science (pp. 195–209). Springer-Verlag. https://doi.org/10.1007/978-3-319-98334-9_13