default search action
Tomás Peitl
Person information
- unicode name: Tomáš Peitl
- affiliation: Friedrich Schiller University of Jena, Institute of Computer Science, Germany
- affiliation (former): TU Vienna, Institute of Logic and Computation, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Benjamin Böhm
, Tomás Peitl, Olaf Beyersdorff:
QCDCL with cube learning or pure literal elimination - What is best? Artif. Intell. 336: 104194 (2024) - [j8]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should Decisions in QCDCL Follow Prefix Order? J. Autom. Reason. 68(1): 5 (2024) - [j7]Olaf Beyersdorff, Joshua Blinkhorn
Hard QBFs for Merge Resolution. ACM Trans. Comput. Theory 16(2): 6:1-6:24 (2024) - [c17]Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. SAT 2024: 31:1-31:22 - [i8]Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small unsatisfiable k-CNFs with bounded literal occurrence. CoRR abs/2405.16149 (2024) - 2023
- [j6]Tomás Peitl
Are hitting formulas hard for resolution? Discret. Appl. Math. 337: 173-184 (2023) - [j5]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): 10:1-10:30 (2023) - [c16]Markus Kirchweger, Tomás Peitl, Stefan Szeider
Co-Certificate Learning with SAT Modulo Symmetries. IJCAI 2023: 1944-1953 - [c15]Markus Kirchweger, Tomás Peitl, Stefan Szeider
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT 2023: 13:1-13:17 - [i7]Markus Kirchweger, Tomás Peitl, Stefan Szeider:
Co-Certificate Learning with SAT Modulo Symmetries. CoRR abs/2306.10427 (2023) - 2022
- [c14]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI 2022: 1781-1787 - [c13]Benjamin Böhm, Tomás Peitl
Should Decisions in QCDCL Follow Prefix Order? SAT 2022: 11:1-11:19 - [i6]Tomás Peitl, Stefan Szeider:
Are Hitting Formulas Hard for Resolution? CoRR abs/2206.15225 (2022) - [i5]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should decisions in QCDCL follow prefix order? Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j4]Tomás Peitl
Finding the Hardest Formulas for Resolution. J. Artif. Intell. Res. 72: 69-97 (2021) - [c12]Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution (Extended Abstract). IJCAI 2021: 4814-4818 - [c11]Joshua Blinkhorn
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT 2021: 30-46 - [i4]Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c10]Tomás Peitl
Finding the Hardest Formulas for Resolution. CP 2020: 514-530 - [c9]Olaf Beyersdorff
Hard QBFs for Merge Resolution. FSTTCS 2020: 12:1-12:15 - [c8]Robert Ganian, Tomás Peitl, Friedrich Slivovsky
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR 2020: 392-402 - [c7]Olaf Beyersdorff
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. SAT 2020: 394-411 - [i3]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. CoRR abs/2012.06779 (2020) - [i2]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. Electron. Colloquium Comput. Complex. TR20 (2020) - [i1]Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j3]Tomás Peitl, Friedrich Slivovsky
Dependency Learning for QBF. J. Artif. Intell. Res. 65: 180-208 (2019) - [j2]Tomás Peitl, Friedrich Slivovsky
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63(1): 127-155 (2019) - [j1]Tomás Peitl, Friedrich Slivovsky
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11(1): 261-272 (2019) - [c6]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Combining Resolution-Path Dependencies with Dependency Learning. SAT 2019: 306-318 - [c5]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT 2019: 319-335 - 2018
- [c4]Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Portfolio-Based Algorithm Selection for Circuit QBFs. CP 2018: 195-209 - [c3]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Polynomial-Time Validation of QCDCL Certificates. SAT 2018: 253-269 - 2017
- [c2]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Dependency Learning for QBF. SAT 2017: 298-313 - 2016
- [c1]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Long Distance Q-Resolution with Dependency Schemes. SAT 2016: 500-518
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: