Tomás Peitl

Orcid: 0000-0001-7799-1568

Affiliations:
  • Friedrich Schiller University of Jena, Institute of Computer Science, Germany
  • TU Vienna, Institute of Logic and Computation, Austria (former)


According to our database1, Tomás Peitl authored at least 21 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QCDCL with cube learning or pure literal elimination - What is best?
Artif. Intell., 2024

Small Unsatisfiable k-CNFs with Bounded Literal Occurrence.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

2023
Are hitting formulas hard for resolution?
Discret. Appl. Math., October, 2023

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.
ACM Trans. Comput. Log., April, 2023

A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Co-Certificate Learning with SAT Modulo Symmetries.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Should decisions in QCDCL follow prefix order?
Electron. Colloquium Comput. Complex., 2022

2021
Finding the Hardest Formulas for Resolution.
J. Artif. Intell. Res., 2021

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.
Electron. Colloquium Comput. Complex., 2021

Davis and Putnam Meet Henkin: Solving DQBF with Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Finding the Hardest Formulas for Resolution (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
Electron. Colloquium Comput. Complex., 2020

Hard QBFs for Merge Resolution.
Electron. Colloquium Comput. Complex., 2020

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019
Qute in the QBF Evaluation 2018.
J. Satisf. Boolean Model. Comput., 2019

Long-Distance Q-Resolution with Dependency Schemes.
J. Autom. Reason., 2019

Dependency Learning for QBF.
J. Artif. Intell. Res., 2019

Proof Complexity of Fragments of Long-Distance Q-Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Combining Resolution-Path Dependencies with Dependency Learning.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018
Polynomial-Time Validation of QCDCL Certificates.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Portfolio-Based Algorithm Selection for Circuit QBFs.
Proceedings of the Principles and Practice of Constraint Programming, 2018


  Loading...