default search action
Leroy Chew
Person information
- affiliation: TU Wien, Vienna, Austria
- affiliation (PhD 2017): University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. Log. Methods Comput. Sci. 20(1) (2024) - [c21]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI 2024: 7978-7986 - [c20]Sravanthi Chede, Leroy Chew, Anil Shukla:
Circuits, Proofs and Propositional Model Counting. FSTTCS 2024: 18:1-18:23 - [c19]Leroy Chew, Alexis de Colnet, Stefan Szeider:
ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. KR 2024 - [i26]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR abs/2402.00542 (2024) - [i25]Sravanthi Chede, Leroy Chew, Anil Shukla:
Circuits, Proofs and Propositional Model Counting. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [d1]Leroy Chew
Dataset of Random Reordered Encodings of Parity Problems. Zenodo, 2023 - [i24]Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla:
Understanding Nullstellensatz for QBFs. Electron. Colloquium Comput. Complex. TR23 (2023) - [i23]Leroy Chew:
Proof Simulation via Round-based Strategy Extraction for QBF. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c18]Leroy Chew
Relating Existing Powerful Proof Systems for QBF. SAT 2022: 10:1-10:22 - [c17]Leroy Chew
Towards Uniform Certification in QBF. STACS 2022: 22:1-22:23 - [i22]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. CoRR abs/2210.07085 (2022) - 2021
- [c16]Leroy Chew
Hardness and Optimality in QBF Proof Systems Modulo NP. SAT 2021: 98-115 - [c15]Zhenjun Liu, Leroy Chew
Avoiding Monochromatic Rectangles Using Shift Patterns. SOCS 2021: 225-227 - [i21]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Olaf Beyersdorff
Frege Systems for Quantified Boolean Logic. J. ACM 67(2): 9:1-9:36 (2020) - [c14]Leroy Chew
How QBF Expansion Makes Strategy Extraction Hard. IJCAR (1) 2020: 66-82 - [c13]Leroy Chew
Sorting Parity Encodings by Reusing Variables. SAT 2020: 1-10 - [i20]Zhenjun Liu, Leroy Chew, Marijn Heule:
Avoiding Monochromatic Rectangles Using Shift Patterns. CoRR abs/2012.12582 (2020) - [i19]Leroy Chew:
Relating existing powerful proof systems for QBF. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j6]Olaf Beyersdorff
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. J. Autom. Reason. 63(3): 597-623 (2019) - [j5]Olaf Beyersdorff
A game characterisation of tree-like Q-Resolution size. J. Comput. Syst. Sci. 104: 82-101 (2019) - [j4]Olaf Beyersdorff
New Resolution-Based QBF Calculi and Their Proof Complexity. ACM Trans. Comput. Theory 11(4): 26:1-26:42 (2019) - [c12]Olaf Beyersdorff
Short Proofs in QBF Expansion. SAT 2019: 19-35 - [c11]Leroy Chew
The Equivalences of Refutational QRAT. SAT 2019: 100-116 - [i18]Leroy Chew, Judith Clymo:
The Equivalences of Refutational QRAT. Electron. Colloquium Comput. Complex. TR19 (2019) - [i17]Leroy Chew, Judith Clymo:
How QBF Expansion Makes Strategy Extraction Hard. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j3]Olaf Beyersdorff
Understanding cutting planes for QBFs. Inf. Comput. 262: 141-161 (2018) - [j2]Olaf Beyersdorff
Are Short Proofs Narrow? QBF Resolution Is Not So Simple. ACM Trans. Comput. Log. 19(1): 1:1-1:26 (2018) - [i16]Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan:
Short Proofs in QBF Expansion. Electron. Colloquium Comput. Complex. TR18 (2018) - [i15]Leroy Chew:
Hardness and Optimality in QBF Proof Systems Modulo NP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Leroy Nicholas Chew:
QBF proof complexity. University of Leeds, UK, 2017 - [j1]Olaf Beyersdorff
Feasible Interpolation for QBF Resolution Calculi. Log. Methods Comput. Sci. 13(2) (2017) - [i14]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c10]Olaf Beyersdorff, Leroy Chew, Mikolas Janota:
Extension Variables in QBF Resolution. AAAI Workshop: Beyond NP 2016 - [c9]Olaf Beyersdorff
Understanding Cutting Planes for QBFs. FSTTCS 2016: 40:1-40:15 - [c8]Olaf Beyersdorff
Lower Bounds: From Circuits to QBF Proof Systems. ITCS 2016: 249-260 - [c7]Olaf Beyersdorff
Lifting QBF Resolution Calculi to DQBF. SAT 2016: 490-499 - [c6]Olaf Beyersdorff
Are Short Proofs Narrow? QBF Resolution is not Simple. STACS 2016: 15:1-15:14 - [i13]Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda:
Lifting QBF Resolution Calculi to DQBF. CoRR abs/1604.08058 (2016) - [i12]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. CoRR abs/1611.01328 (2016) - [i11]Olaf Beyersdorff, Leroy Chew, Mikolas Janota:
Extension Variables in QBF Resolution. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda:
Lifting QBF Resolution Calculi to DQBF. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c5]Olaf Beyersdorff
Feasible Interpolation for QBF Resolution Calculi. ICALP (1) 2015: 180-192 - [c4]Olaf Beyersdorff
A Game Characterisation of Tree-like Q-resolution Size. LATA 2015: 486-498 - [c3]Olaf Beyersdorff
Proof Complexity of Resolution-based QBF Calculi. STACS 2015: 76-89 - [i9]Olaf Beyersdorff, Ilario Bonacina, Leroy Chew:
Lower bounds: from circuits to QBF proof systems. Electron. Colloquium Comput. Complex. TR15 (2015) - [i8]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c2]Olaf Beyersdorff
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. IJCAR 2014: 403-417 - [c1]Olaf Beyersdorff
On Unification of QBF Resolution-Based Calculi. MFCS (2) 2014: 81-93 - [i6]Olaf Beyersdorff, Leroy Chew:
Tableau vs. Sequent Calculi for Minimal Entailment. CoRR abs/1405.1565 (2014) - [i5]Olaf Beyersdorff, Leroy Chew:
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. Electron. Colloquium Comput. Complex. TR14 (2014) - [i4]Olaf Beyersdorff, Leroy Chew:
Tableau vs. Sequent Calculi for Minimal Entailment. Electron. Colloquium Comput. Complex. TR14 (2014) - [i3]Olaf Beyersdorff, Leroy Chew, Mikolas Janota:
Proof Complexity of Resolution-based QBF Calculi. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A game characterisation of tree-like Q-Resolution size. Electron. Colloquium Comput. Complex. TR14 (2014) - [i1]Mikolas Janota, Leroy Chew, Olaf Beyersdorff:
On Unification of QBF Resolution-Based Calculi. Electron. Colloquium Comput. Complex. TR14 (2014)
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-12-18 19:22 CET 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: