Tomás Peitl

43 papers A* 6A 13Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Graph Choosability via SAT: Beyond the Nullstellensatz.
AAAI
Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider
2025 A conf
Better Extension Variables in DQBF via Independence.
SAT
Leroy Chew, Tomás Peitl
2025 J jnl
Better Extension Variables in DQBF via Independence.
CoRR
Leroy Chew, Tomás Peitl
2025 A* conf
Breaking Symmetries in Quantified Graph Search: A Comparative Study.
AAAI
Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider
2025 J jnl
Breaking Symmetries in Quantified Graph Search: A Comparative Study.
CoRR
Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider
2025 J jnl
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT.
CoRR
Markus Kirchweger, Tomás Peitl, Bernardo Subercaseaux, Stefan Szeider
2025 J jnl
Smart Cubing for Graph Search: A Comparative Study.
CoRR
Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider
2025 J jnl
Strong (D)QBF Dependency Schemes via Pure Universal Resolution Paths.
Electron. Colloquium Comput. Complex.
Leroy Chew, Tomás Peitl
2024 J jnl
Hard QBFs for Merge Resolution.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2024 J jnl
QCDCL with cube learning or pure literal elimination - What is best?
Artif. Intell.
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
2024 J jnl
Should Decisions in QCDCL Follow Prefix Order?
J. Autom. Reason.
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
2024 A conf
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence.
SAT
Tianwei Zhang, Tomás Peitl, Stefan Szeider
2024 J jnl
Small unsatisfiable k-CNFs with bounded literal occurrence.
CoRR
Tianwei Zhang, Tomás Peitl, Stefan Szeider
2024 J jnl
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Joshua Lewis Blinkhorn, Tomás Peitl
2023 A conf
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.
SAT
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 J jnl
Are hitting formulas hard for resolution?
Discret. Appl. Math.
Tomás Peitl, Stefan Szeider
2023 A* conf
Co-Certificate Learning with SAT Modulo Symmetries.
IJCAI
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 J jnl
Co-Certificate Learning with SAT Modulo Symmetries.
CoRR
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 J jnl
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.
ACM Trans. Comput. Log.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl
2022 J jnl
Are Hitting Formulas Hard for Resolution?
CoRR
Tomás Peitl, Stefan Szeider
2022 A* conf
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
IJCAI
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
2022 A conf
Should Decisions in QCDCL Follow Prefix Order?
SAT
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
2022 J jnl
Should decisions in QCDCL follow prefix order?
Electron. Colloquium Comput. Complex.
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
2021 A conf
Davis and Putnam Meet Henkin: Solving DQBF with Resolution.
SAT
Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky
2021 A* conf
Finding the Hardest Formulas for Resolution (Extended Abstract).
IJCAI
Tomás Peitl, Stefan Szeider
2021 J jnl
Finding the Hardest Formulas for Resolution.
J. Artif. Intell. Res.
Tomás Peitl, Stefan Szeider
2021 J jnl
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2020 A conf
Finding the Hardest Formulas for Resolution.
CP
Tomás Peitl, Stefan Szeider
2020 A* conf
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
KR
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2020 — conf
Hard QBFs for Merge Resolution.
FSTTCS
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 J jnl
Hard QBFs for Merge Resolution.
CoRR
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 J jnl
Hard QBFs for Merge Resolution.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 A conf
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths.
SAT
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2020 J jnl
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2019 A conf
Combining Resolution-Path Dependencies with Dependency Learning.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Dependency Learning for QBF.
J. Artif. Intell. Res.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Long-Distance Q-Resolution with Dependency Schemes.
J. Autom. Reason.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 A conf
Proof Complexity of Fragments of Long-Distance Q-Resolution.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Qute in the QBF Evaluation 2018.
J. Satisf. Boolean Model. Comput.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018 A conf
Polynomial-Time Validation of QCDCL Certificates.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018 A conf
Portfolio-Based Algorithm Selection for Circuit QBFs.
CP
Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2017 A conf
Dependency Learning for QBF.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2016 A conf
Long Distance Q-Resolution with Dependency Schemes.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider