Tomás Peitl

According to our database, Tomás Peitl authored at least 20 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Are hitting formulas hard for resolution?

Tomás Peitl, Stefan Szeider

Discret. Appl. Math., October, 2023

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl

ACM Trans. Comput. Log., April, 2023

A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.

Markus Kirchweger, Tomás Peitl, Stefan Szeider

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Co-Certificate Learning with SAT Modulo Symmetries.

Markus Kirchweger, Tomás Peitl, Stefan Szeider

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Should decisions in QCDCL follow prefix order?

Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff

Electron. Colloquium Comput. Complex., 2022

QCDCL with Cube Learning or Pure Literal Elimination - What is Best?

Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Finding the Hardest Formulas for Resolution.

Tomás Peitl, Stefan Szeider

J. Artif. Intell. Res., 2021

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

Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl

Electron. Colloquium Comput. Complex., 2021

Davis and Putnam Meet Henkin: Solving DQBF with Resolution.

Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Finding the Hardest Formulas for Resolution (Extended Abstract).

Tomás Peitl, Stefan Szeider

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

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

Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl

Electron. Colloquium Comput. Complex., 2020

Hard QBFs for Merge Resolution.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood

Electron. Colloquium Comput. Complex., 2020

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.

Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Qute in the QBF Evaluation 2018.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

J. Satisf. Boolean Model. Comput., 2019

Long-Distance Q-Resolution with Dependency Schemes.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

J. Autom. Reason., 2019

Dependency Learning for QBF.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

J. Artif. Intell. Res., 2019

Proof Complexity of Fragments of Long-Distance Q-Resolution.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Combining Resolution-Path Dependencies with Dependency Learning.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Polynomial-Time Validation of QCDCL Certificates.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Portfolio-Based Algorithm Selection for Circuit QBFs.

Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2018