Leroy Chew

62 papers A* 3A 13B 1C 1Journal 38Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Reintroducing the Second Player in EPR.
CoRR
Leroy Chew, Mikolás Janota, Miroslav Olsák, Martin Suda
2025 A conf
An Expansion-Based Approach for Quantified Integer Programming.
CP
Michael Hartisch, Leroy Chew
2025 J jnl
An Expansion-Based Approach for Quantified Integer Programming.
CoRR
Michael Hartisch, Leroy Chew
2025 A conf
Better Extension Variables in DQBF via Independence.
SAT
Leroy Chew, Tomás Peitl
2025 J jnl
Better Extension Variables in DQBF via Independence.
CoRR
Leroy Chew, Tomás Peitl
2025 A* conf
Proof Simulation via Round-based Strategy Extraction for QBF.
AAAI
Leroy Chew
2025 J jnl
Strong (D)QBF Dependency Schemes via Pure Universal Resolution Paths.
Electron. Colloquium Comput. Complex.
Leroy Chew, Tomás Peitl
2024 A* conf
ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP.
KR
Leroy Chew, Alexis de Colnet, Stefan Szeider
2024 — conf
Circuits, Proofs and Propositional Model Counting.
FSTTCS
Sravanthi Chede, Leroy Chew, Anil Shukla
2024 J jnl
Circuits, Proofs and Propositional Model Counting.
Electron. Colloquium Comput. Complex.
Sravanthi Chede, Leroy Chew, Anil Shukla
2024 A* conf
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.
AAAI
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024 J jnl
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.
CoRR
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024 J jnl
Towards Uniform Certification in QBF.
Log. Methods Comput. Sci.
Leroy Chew, Friedrich Slivovsky
2023 J jnl
Proof Simulation via Round-based Strategy Extraction for QBF.
Electron. Colloquium Comput. Complex.
Leroy Chew
2023 J jnl
Understanding Nullstellensatz for QBFs.
Electron. Colloquium Comput. Complex.
Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla
2022 A conf
Relating Existing Powerful Proof Systems for QBF.
SAT
Leroy Chew, Marijn J. H. Heule
2022 A conf
Towards Uniform Certification in QBF.
STACS
Leroy Chew, Friedrich Slivovsky
2022 J jnl
Towards Uniform Certification in QBF.
CoRR
Leroy Chew, Friedrich Slivovsky
2021 B conf
Avoiding Monochromatic Rectangles Using Shift Patterns.
SOCS
Zhenjun Liu, Leroy Chew, Marijn J. H. Heule
2021 A conf
Hardness and Optimality in QBF Proof Systems Modulo NP.
SAT
Leroy Chew
2021 J jnl
Towards Uniform Certification in QBF.
Electron. Colloquium Comput. Complex.
Leroy Chew, Friedrich Slivovsky
2020 J jnl
Avoiding Monochromatic Rectangles Using Shift Patterns.
CoRR
Zhenjun Liu, Leroy Chew, Marijn Heule
2020 J jnl
Frege Systems for Quantified Boolean Logic.
J. ACM
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich
2020 — conf
How QBF Expansion Makes Strategy Extraction Hard.
IJCAR (1)
Leroy Chew, Judith Clymo
2020 J jnl
Relating existing powerful proof systems for QBF.
Electron. Colloquium Comput. Complex.
Leroy Chew
2020 A conf
Sorting Parity Encodings by Reusing Variables.
SAT
Leroy Chew, Marijn J. H. Heule
2019 J jnl
A game characterisation of tree-like Q-Resolution size.
J. Comput. Syst. Sci.
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2019 J jnl
How QBF Expansion Makes Strategy Extraction Hard.
Electron. Colloquium Comput. Complex.
Leroy Chew, Judith Clymo
2019 J jnl
New Resolution-Based QBF Calculi and Their Proof Complexity.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
2019 J jnl
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF.
J. Autom. Reason.
Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate A. Schmidt, Martin Suda
2019 A conf
Short Proofs in QBF Expansion.
SAT
Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan
2019 A conf
The Equivalences of Refutational QRAT.
SAT
Leroy Chew, Judith Clymo
2019 J jnl
The Equivalences of Refutational QRAT.
Electron. Colloquium Comput. Complex.
Leroy Chew, Judith Clymo
2018 J jnl
Are Short Proofs Narrow? QBF Resolution Is
ACM Trans. Comput. Log.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2018 J jnl
Hardness and Optimality in QBF Proof Systems Modulo NP.
Electron. Colloquium Comput. Complex.
Leroy Chew
2018 J jnl
Short Proofs in QBF Expansion.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan
2018 J jnl
Understanding cutting planes for QBFs.
Inf. Comput.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2017 J jnl
Feasible Interpolation for QBF Resolution Calculi.
Log. Methods Comput. Sci.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2017 J jnl
Understanding Cutting Planes for QBFs.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2016 A conf
Are Short Proofs Narrow? QBF Resolution is not Simple.
STACS
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2016 — conf
Extension Variables in QBF Resolution.
AAAI Workshop: Beyond NP
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
2016 J jnl
Extension Variables in QBF Resolution.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
2016 J jnl
Feasible Interpolation for QBF Resolution Calculi.
CoRR
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2016 A conf
Lifting QBF Resolution Calculi to DQBF.
SAT
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
2016 J jnl
Lifting QBF Resolution Calculi to DQBF.
CoRR
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
2016 J jnl
Lifting QBF Resolution Calculi to DQBF.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
2016 A conf
Lower Bounds: From Circuits to QBF Proof Systems.
ITCS
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
2016 — conf
Understanding Cutting Planes for QBFs.
FSTTCS
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2015 C conf
A Game Characterisation of Tree-like Q-resolution Size.
LATA
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2015 J jnl
Are Short Proofs Narrow? QBF Resolution is not Simple.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2015 — conf
Feasible Interpolation for QBF Resolution Calculi.
ICALP (1)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2015 J jnl
Feasible Interpolation for QBF Resolution Calculi.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2015 J jnl
Lower bounds: from circuits to QBF proof systems.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
2015 A conf
Proof Complexity of Resolution-based QBF Calculi.
STACS
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
2014 J jnl
A game characterisation of tree-like Q-Resolution size.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2014 — conf
On Unification of QBF Resolution-Based Calculi.
MFCS (2)
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
2014 J jnl
On Unification of QBF Resolution-Based Calculi.
Electron. Colloquium Comput. Complex.
Mikolas Janota, Leroy Chew, Olaf Beyersdorff
2014 J jnl
Proof Complexity of Resolution-based QBF Calculi.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
2014 J jnl
Tableau vs. Sequent Calculi for Minimal Entailment.
CoRR
Olaf Beyersdorff, Leroy Chew
2014 J jnl
Tableau vs. Sequent Calculi for Minimal Entailment.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew
2014 A conf
The Complexity of Theorem Proving in Circumscription and Minimal Entailment.
IJCAR
Olaf Beyersdorff, Leroy Chew
2014 J jnl
The Complexity of Theorem Proving in Circumscription and Minimal Entailment.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew