Tomás Peitl

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 33

Top Topics

Mutual Exclusion

Quantified Boolean Formulae

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Tianwei Zhang, Tomás Peitl, Stefan Szeider
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. SAT (2024)
Tianwei Zhang, Tomás Peitl, Stefan Szeider
Small unsatisfiable k-CNFs with bounded literal occurrence. CoRR (2024)
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
QCDCL with cube learning or pure literal elimination - What is best? Artif. Intell. 336 (2024)
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
Should Decisions in QCDCL Follow Prefix Order? J. Autom. Reason. 68 (1) (2024)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
Co-Certificate Learning with SAT Modulo Symmetries. IJCAI (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
Co-Certificate Learning with SAT Modulo Symmetries. CoRR (2023)
Tomás Peitl, Stefan Szeider
Are hitting formulas hard for resolution? Discret. Appl. Math. 337 (2023)
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Trans. Comput. Log. 24 (2) (2023)
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI (2022)
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
Should decisions in QCDCL follow prefix order? Electron. Colloquium Comput. Complex. (2022)
Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff
Should Decisions in QCDCL Follow Prefix Order? SAT (2022)
Tomás Peitl, Stefan Szeider
Are Hitting Formulas Hard for Resolution? CoRR (2022)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution (Extended Abstract). IJCAI (2021)
Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT (2021)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution. J. Artif. Intell. Res. 72 (2021)
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. Electron. Colloquium Comput. Complex. 28 (2021)
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
Hard QBFs for Merge Resolution. CoRR (2020)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution. CP (2020)
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR (2020)
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. Electron. Colloquium Comput. Complex. 27 (2020)
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
Hard QBFs for Merge Resolution. Electron. Colloquium Comput. Complex. 27 (2020)
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. SAT (2020)
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
Hard QBFs for Merge Resolution. FSTTCS (2020)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Combining Resolution-Path Dependencies with Dependency Learning. SAT (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63 (1) (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11 (1) (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Dependency Learning for QBF. J. Artif. Intell. Res. 65 (2019)
Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Portfolio-Based Algorithm Selection for Circuit QBFs. CP (2018)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Polynomial-Time Validation of QCDCL Certificates. SAT (2018)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Dependency Learning for QBF. SAT (2017)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Long Distance Q-Resolution with Dependency Schemes. SAT (2016)