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

Project Acronym: ASK-SAT (Alternating Symmetry-Breaking Combinatorial Search …

Variable Dependencies of Quantified Boolean Formulas

Funding Organisation: The Austrian Science Fund, FWF

Recent Publications

Graph Choosability via SAT: Beyond the Nullstellensatz

2026

Better Extension Variables in DQBF via Independence

2025

QCDCL with cube learning or pure literal elimination - What is best?

2024

Should Decisions in QCDCL Follow Prefix Order?

2024

Small unsatisfiable k-CNFs with bounded literal occurrence

2024

Co-Certificate Learning with SAT Modulo Symmetries

2023

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

2022

Davis and Putnam Meet Henkin: Solving DQBF with Resolution

2021

Finding the Hardest Formulas for Resolution

2021

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths

2021

Hard QBFs for Merge Resolution

2020

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths

2020

Combining Resolution-Path Dependencies with Dependency Learning

2019

Dependency Learning for QBF

2019

Long-Distance Q-Resolution with Dependency Schemes

2019

Proof Complexity of Fragments of Long-Distance Q-resolution

2019

Polynomial-Time Validation of QCDCL Certificates

2018

Portfolio Solvers for QDIMACS and QCIR

2018

Portfolio-Based Algorithm Selection for Circuit QBFs

2018

QBF Encodings of Chess Problems

2018