The Complexity of Theorem Proving in Circumscription and Minimal Entailment. - Olaf Beyersdorff; Leroy Chew (Electron. Colloquium Comput. Complex., 2014)

Tableau vs. Sequent Calculi for Minimal Entailment. - Olaf Beyersdorff; Leroy Chew (Electron. Colloquium Comput. Complex., 2014)

Proof Complexity of Resolution-based QBF Calculi. - Olaf Beyersdorff; Leroy Chew; Mikolas Janota (Electron. Colloquium Comput. Complex., 2014)

On Unification of QBF Resolution-Based Calculi. - Mikolas Janota; Leroy Chew; Olaf Beyersdorff (Electron. Colloquium Comput. Complex., 2014)

Lower bounds: from circuits to QBF proof systems. - Olaf Beyersdorff; Ilario Bonacina; Leroy Chew (Electron. Colloquium Comput. Complex., 2015)

Feasible Interpolation for QBF Resolution Calculi. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2015)

Are Short Proofs Narrow? QBF Resolution is not Simple. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2015)

Extension Variables in QBF Resolution. - Olaf Beyersdorff; Leroy Chew; Mikolas Janota (Electron. Colloquium Comput. Complex., 2016)

Lifting QBF Resolution Calculi to DQBF. - Olaf Beyersdorff; Leroy Chew; Renate A. Schmidt; Martin Suda 001 (Electron. Colloquium Comput. Complex., 2016)

Understanding Cutting Planes for QBFs. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (Electron. Colloquium Comput. Complex., 2017)

QBF proof complexity. - Leroy Nicholas Chew (2017)

Short Proofs in QBF Expansion. - Olaf Beyersdorff; Leroy Chew; Judith Clymo; Meena Mahajan (Electron. Colloquium Comput. Complex., 2018)

Hardness and Optimality in QBF Proof Systems Modulo NP. - Leroy Chew (Electron. Colloquium Comput. Complex., 2018)

Are Short Proofs Narrow? QBF Resolution Is Not So Simple. - Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla (ACM Trans. Comput. Log., 2018)

The Equivalences of Refutational QRAT. - Leroy Chew; Judith Clymo (Electron. Colloquium Comput. Complex., 2019)

How QBF Expansion Makes Strategy Extraction Hard. - Leroy Chew; Judith Clymo (Electron. Colloquium Comput. Complex., 2019)

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. - Olaf Beyersdorff; Joshua Blinkhorn; Leroy Chew; Renate A. Schmidt; Martin Suda 001 (J. Autom. Reason., 2019)

A game characterisation of tree-like Q-Resolution size. - Olaf Beyersdorff; Leroy Chew; Karteek Sreenivasaiah (J. Comput. Syst. Sci., 2019)

New Resolution-Based QBF Calculi and Their Proof Complexity. - Olaf Beyersdorff; Leroy Chew; Mikolás Janota (ACM Trans. Comput. Theory, 2019)

Sorting Parity Encodings by Reusing Variables. - Leroy Chew; Marijn J. H. Heule (SAT, 2020)

Relating existing powerful proof systems for QBF. - Leroy Chew (Electron. Colloquium Comput. Complex., 2020)

Frege Systems for Quantified Boolean Logic. - Olaf Beyersdorff; Ilario Bonacina; Leroy Chew; Ján Pich (J. ACM, 2020)

Avoiding Monochromatic Rectangles Using Shift Patterns. - Zhenjun Liu; Leroy Chew; Marijn J. H. Heule (SOCS, 2021)

Towards Uniform Certification in QBF. - Leroy Chew; Friedrich Slivovsky (Electron. Colloquium Comput. Complex., 2021)

Relating Existing Powerful Proof Systems for QBF. - Leroy Chew; Marijn J. H. Heule (SAT, 2022)

Understanding Nullstellensatz for QBFs. - Sravanthi Chede; Leroy Chew; Balesh Kumar; Anil Shukla (Electron. Colloquium Comput. Complex., 2023)

Proof Simulation via Round-based Strategy Extraction for QBF. - Leroy Chew (Electron. Colloquium Comput. Complex., 2023)

Dataset of Random Reordered Encodings of Parity Problems. - Leroy Chew; Alexis de Colnet; Friedrich Slivovsky; Stefan Szeider (Zenodo, 2023)

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. - Leroy Chew; Alexis de Colnet; Friedrich Slivovsky; Stefan Szeider (AAAI, 2024)

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. - Leroy Chew; Alexis de Colnet; Stefan Szeider (KR, 2024)

Circuits, Proofs and Propositional Model Counting. - Sravanthi Chede; Leroy Chew; Anil Shukla (Electron. Colloquium Comput. Complex., 2024)

An Expansion-Based Approach for Quantified Integer Programming. - Michael Hartisch; Leroy Chew (CP, 2025)

Better Extension Variables in DQBF via Independence. - Leroy Chew; Tomás Peitl (SAT, 2025)