Tomas Peitl

Address:
Tomas Peitl
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HA0402 (how to get there)
Phone:	+43(1)58801–192124
Email:	peitl@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/peitl/

Research Interests

QBF, DQBF, SAT, Proof Theory, Complexity Theory, Graph Theory

Current Position

I am a PhD student funded by the FWF project P27721 and partially by Doctoral College Logical Methods in Computer Science, TU Wien. I started my PhD studies in September 2015 under the supervision of Prof. Dr. Stefan Szeider. I am also a project assistant in the Algorithms and Complexity Group.

Education

MSc in Mathematics (Comenius University, Bratislava, Slovakia)
BSc in Mathematics (Comenius University, Bratislava, Slovakia)

Publications:

10 results

2019
[10]	Dependency Learning for QBF Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal Artificial Intelligence Research, volume 65, pages 180–208, 2019. [bibtex] [pdf]
[9]	Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. [bibtex] [pdf] [doi]
[8]	Proof Complexity of Fragments of Long-Distance Q-resolution Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. [bibtex] [pdf]
[7]	Combining Resolution-Path Dependencies with Dependency Learning Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. [bibtex] [pdf]
2018
[6]	Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 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, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. [bibtex] [pdf] [doi]
[5]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider QBF Workshop, 2018. [bibtex]
[4]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag. [bibtex] [pdf] [doi]
[3]	Portfolio Solvers for QDIMACS and QCIR Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018. Note: QBF Evaluation at SAT [bibtex]
2017
[2]	Dependency learning for QBF Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. [bibtex] [pdf] [doi]
2016
[1]	Long Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. [bibtex] [pdf] [doi]