Tomas Peitl
Univ.Ass. Dr.techn.

Tomas Peitl

Office Hours:
Please email peitl@ac.tuwien.ac.at for appointments.

Biography

Tomáš Peitl is part of the Scientific Staff at TU Wien.

Projects

ASK-SAT: Alternating Symmetry-Breaking Combinatorial Search with SAT

Variable Dependencies of Quantified Boolean Formulas

Recent Publications

Graph Choosability via SAT: Beyond the Nullstellensatz
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear
Better Extension Variables in DQBF via Independence
28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 11:1-11:24, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hard QBFs for Merge Resolution
ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1-6:24, 2024.
Should Decisions in QCDCL Follow Prefix Order?
J. Autom. Reason., volume 68, number 1, pages 5, 2024.
Small unsatisfiable k-CNFs with bounded literal occurrence
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Chakraborty, Supratik and Jiang, Jie-Hong Roland), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1-31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Co-Certificate Learning with SAT Modulo Symmetries
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944-1953, 2023, ijcai.org.
Note: Main Track
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.
Davis and Putnam Meet Henkin: Solving DQBF with Resolution
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li and Felip Manyà), volume 12831 of Lecture Notes in Computer Science, pages 30-46, 2021, Springer.
Davis and Putnam Meet Henkin: Solving DQBF with Resolution
2021, Technical report AC-TR-21-012, Algorithms and Complexity Group, TU Wien.
Finding the Hardest Formulas for Resolution
Journal of Artificial Intelligence Research, volume 72, pages 69-97, 2021.
Note: Conference Award Track, best paper CP 2020
Finding the Hardest Formulas for Resolution
2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien.
Finding the Hardest Formulas for Resolution
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 514-530, 2020, Springer Verlag.
Note: Best Paper Award
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.
Combining Resolution-Path Dependencies with Dependency Learning
2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien.
Combining Resolution-Path Dependencies with Dependency Learning
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota and Inês Lynce), volume 11628 of Lecture Notes in Computer Science, pages 306-318, 2019, Springer Verlag.
Dependency Learning for QBF
Journal of Artificial Intelligence Research, volume 65, pages 180-208, 2019.
Long-Distance Q-Resolution with Dependency Schemes
Journal of Automated Reasoning, volume 63, number 1, pages 127-155, 2019.
Proof Complexity of Fragments of Long-Distance Q-resolution
2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien.
Proof Complexity of Fragments of Long-Distance Q-resolution
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota and Inês Lynce), volume 11628 of Lecture Notes in Computer Science, pages 319-335, 2019, Springer Verlag.
Polynomial-Time Validation of QCDCL Certificates
2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien.
Polynomial-Time Validation of QCDCL Certificates
Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff and Christoph M. Wintersteiger), volume 10929 of Lecture Notes in Computer Science, pages 253-269, 2018, Springer Verlag.
Portfolio-Based Algorithm Selection for Circuit QBFs
2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien.
Portfolio-Based Algorithm Selection for Circuit QBFs
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker), volume 11008 of Lecture Notes in Computer Science, pages 195-209, 2018, Springer Verlag.
QBF Encodings of Chess Problems
2018, Technical report AC-TR-18-013, Algorithms and Complexity Group, TU Wien.
Dependency Learning for QBF
2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien.
Long-Distance Q-Resolution with Dependency Schemes
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 298-313, 2017, Springer Verlag.
Long Distance Q-Resolution with Dependency Schemes
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou and Daniel Le Berre), volume 9710 of Lecture Notes in Computer Science, pages 500-518, 2016, Springer Verlag.