( en | de | ru )

 

Disambiguation of "Peitl, Tomás"

Author of the publication

copydeleteadd this publication to your clipboard
Dependency Learning for QBF.

, , and . J. Artif. Intell. Res., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

Other publications of authors with the same name

Long Distance Q-Resolution with Dependency Schemes., , and . SAT, volume 9710 of Lecture Notes in Computer Science, page 500-518. Springer, (2016)Finding the Hardest Formulas for Resolution., and . J. Artif. Intell. Res., (2021)Long-Distance Q-Resolution with Dependency Schemes., , and . J. Autom. Reason., 63 (1): 127-155 (2019)Should Decisions in QCDCL Follow Prefix Order?, , and . SAT, volume 236 of LIPIcs, page 11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture., , and . SAT, volume 271 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fixed-Parameter Tractability of Dependency QBF with Structural Parameters., , , and . KR, page 392-402. (2020)Proof Complexity of Fragments of Long-Distance Q-Resolution., , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 319-335. Springer, (2019)Finding the Hardest Formulas for Resolution., and . CP, volume 12333 of Lecture Notes in Computer Science, page 514-530. Springer, (2020)Hardness Characterisations and Size-width Lower Bounds for QBF Resolution., , , and . ACM Trans. Comput. Log., 24 (2): 10:1-10:30 (April 2023)Are hitting formulas hard for resolution?, and . Discret. Appl. Math., (October 2023)