Follow
Tomáš Peitl
Tomáš Peitl
Verified email at ac.tuwien.ac.at - Homepage
Title
Cited by
Cited by
Year
Dependency learning for QBF
T Peitl, F Slivovsky, S Szeider
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
362017
Long-distance Q-resolution with dependency schemes
T Peitl, F Slivovsky, S Szeider
Journal of Automated Reasoning 63, 127-155, 2019
322019
Dependency learning for QBF
T Peitl, F Slivovsky, S Szeider
Journal of Artificial Intelligence Research 65, 181-208, 2019
272019
Portfolio-based algorithm selection for circuit qbfs
HH Hoos, T Peitl, F Slivovsky, S Szeider
Principles and Practice of Constraint Programming: 24th International …, 2018
192018
Hardness characterisations and size-width lower bounds for QBF resolution
O Beyersdorff, J Blinkhorn, M Mahajan, T Peitl
ACM Transactions on Computational Logic 24 (2), 1-30, 2023
122023
Polynomial-time validation of QCDCL certificates
T Peitl, F Slivovsky, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2018
82018
Hard QBFs for merge resolution
O Beyersdorff, J Blinkhorn, M Mahajan, T Peitl, G Sood
ACM Transactions on Computation Theory 16 (2), 1-24, 2024
62024
Davis and Putnam meet Henkin: Solving DQBF with resolution
J Blinkhorn, T Peitl, F Slivovsky
Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021
62021
Fixed-parameter tractability of dependency QBF with structural parameters
R Ganian, T Peitl, F Slivovsky, S Szeider
Proceedings of the International Conference on Principles of Knowledge …, 2020
62020
Proof complexity of fragments of long-distance Q-resolution
T Peitl, F Slivovsky, S Szeider
Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019
62019
Should decisions in QCDCL follow prefix order?
B Böhm, T Peitl, O Beyersdorff
Journal of Automated Reasoning 68 (1), 5, 2024
52024
QCDCL with cube learning or pure literal elimination-what is best?
B Böhm, T Peitl, O Beyersdorff
IJCAI, 1781-1787, 2022
52022
Combining resolution-path dependencies with dependency learning
T Peitl, F Slivovsky, S Szeider
Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019
52019
Co-certificate learning with SAT modulo symmetries
M Kirchweger, T Peitl, S Szeider
arXiv preprint arXiv:2306.10427, 2023
42023
Are hitting formulas hard for resolution?
T Peitl, S Szeider
Discrete Applied Mathematics 337, 173-184, 2023
32023
Finding the hardest formulas for resolution
T Peitl, S Szeider
Journal of Artificial Intelligence Research 72, 69-97, 2021
32021
Strong (D) QBF dependency schemes via tautology-free resolution paths
O Beyersdorff, J Blinkhorn, T Peitl
International Conference on Theory and Applications of Satisfiability …, 2020
32020
A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture
M Kirchweger, T Peitl, S Szeider
26th International Conference on Theory and Applications of Satisfiability …, 2023
22023
Qute in the QBF evaluation 2018
T Peitl, F Slivovsky, S Szeider
Journal on Satisfiability, Boolean Modeling and Computation 11 (1), 261-272, 2019
22019
Advanced dependency analysis for QBF
T Peitl
Technische Universität Wien, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20