Leroy Chew

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 45

Top Topics

Quantified Boolean Formulae

Theorem Proving

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI (2024)
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR (2024)
Sravanthi Chede, Leroy Chew, Anil Shukla
Circuits, Proofs and Propositional Model Counting. Electron. Colloquium Comput. Complex. (2024)
Leroy Chew, Friedrich Slivovsky
Towards Uniform Certification in QBF. Log. Methods Comput. Sci. 20 (1) (2024)
Leroy Chew
Proof Simulation via Round-based Strategy Extraction for QBF. Electron. Colloquium Comput. Complex. (2023)
Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla
Understanding Nullstellensatz for QBFs. Electron. Colloquium Comput. Complex. (2023)
Leroy Chew, Marijn J. H. Heule
Relating Existing Powerful Proof Systems for QBF. SAT (2022)
Leroy Chew, Friedrich Slivovsky
Towards Uniform Certification in QBF. CoRR (2022)
Leroy Chew, Friedrich Slivovsky
Towards Uniform Certification in QBF. STACS (2022)
Leroy Chew, Friedrich Slivovsky
Towards Uniform Certification in QBF. Electron. Colloquium Comput. Complex. 28 (2021)
Zhenjun Liu, Leroy Chew, Marijn J. H. Heule
Avoiding Monochromatic Rectangles Using Shift Patterns. SOCS (2021)
Leroy Chew
Hardness and Optimality in QBF Proof Systems Modulo NP. SAT (2021)
Zhenjun Liu, Leroy Chew, Marijn Heule
Avoiding Monochromatic Rectangles Using Shift Patterns. CoRR (2020)
Leroy Chew
Relating existing powerful proof systems for QBF. Electron. Colloquium Comput. Complex. 27 (2020)
Leroy Chew, Marijn J. H. Heule
Sorting Parity Encodings by Reusing Variables. SAT (2020)
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich
Frege Systems for Quantified Boolean Logic. J. ACM 67 (2) (2020)
Leroy Chew, Judith Clymo
How QBF Expansion Makes Strategy Extraction Hard. IJCAR (1) (2020)
Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan
Short Proofs in QBF Expansion. SAT (2019)
Leroy Chew, Judith Clymo
The Equivalences of Refutational QRAT. Electron. Colloquium Comput. Complex. 26 (2019)
Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate A. Schmidt, Martin Suda
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. J. Autom. Reason. 63 (3) (2019)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A game characterisation of tree-like Q-Resolution size. J. Comput. Syst. Sci. 104 (2019)
Leroy Chew, Judith Clymo
The Equivalences of Refutational QRAT. SAT (2019)
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
New Resolution-Based QBF Calculi and Their Proof Complexity. ACM Trans. Comput. Theory 11 (4) (2019)
Leroy Chew, Judith Clymo
How QBF Expansion Makes Strategy Extraction Hard. Electron. Colloquium Comput. Complex. 26 (2019)
Leroy Chew
Hardness and Optimality in QBF Proof Systems Modulo NP. Electron. Colloquium Comput. Complex. 25 (2018)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Understanding cutting planes for QBFs. Inf. Comput. 262 (2018)
Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan
Short Proofs in QBF Expansion. Electron. Colloquium Comput. Complex. 25 (2018)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
So Simple. ACM Trans. Comput. Log. 19 (1) (2018)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Understanding Cutting Planes for QBFs. Electron. Colloquium Comput. Complex. 24 (2017)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Feasible Interpolation for QBF Resolution Calculi. Log. Methods Comput. Sci. 13 (2) (2017)
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
Extension Variables in QBF Resolution. Electron. Colloquium Comput. Complex. 23 (2016)
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
Lifting QBF Resolution Calculi to DQBF. SAT (2016)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Understanding Cutting Planes for QBFs. FSTTCS (2016)
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
Lower Bounds: From Circuits to QBF Proof Systems. ITCS (2016)
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
Extension Variables in QBF Resolution. AAAI Workshop: Beyond NP (2016)
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
Lifting QBF Resolution Calculi to DQBF. CoRR (2016)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Are Short Proofs Narrow? QBF Resolution is not Simple. STACS (2016)
Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
Lifting QBF Resolution Calculi to DQBF. Electron. Colloquium Comput. Complex. 23 (2016)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Feasible Interpolation for QBF Resolution Calculi. CoRR (2016)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A Game Characterisation of Tree-like Q-resolution Size. LATA (2015)
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
Lower bounds: from circuits to QBF proof systems. Electron. Colloquium Comput. Complex. 22 (2015)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Feasible Interpolation for QBF Resolution Calculi. Electron. Colloquium Comput. Complex. 22 (2015)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Are Short Proofs Narrow? QBF Resolution is not Simple. Electron. Colloquium Comput. Complex. 22 (2015)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
Feasible Interpolation for QBF Resolution Calculi. ICALP (1) (2015)
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
Proof Complexity of Resolution-based QBF Calculi. STACS (2015)
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
On Unification of QBF Resolution-Based Calculi. MFCS (2) (2014)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A game characterisation of tree-like Q-Resolution size. Electron. Colloquium Comput. Complex. 21 (2014)
Olaf Beyersdorff, Leroy Chew
Tableau vs. Sequent Calculi for Minimal Entailment. CoRR (2014)
Olaf Beyersdorff, Leroy Chew
Tableau vs. Sequent Calculi for Minimal Entailment. Electron. Colloquium Comput. Complex. 21 (2014)
Olaf Beyersdorff, Leroy Chew
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. IJCAR (2014)
Olaf Beyersdorff, Leroy Chew, Mikolas Janota
Proof Complexity of Resolution-based QBF Calculi. Electron. Colloquium Comput. Complex. 21 (2014)
Olaf Beyersdorff, Leroy Chew
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. Electron. Colloquium Comput. Complex. 21 (2014)
Mikolas Janota, Leroy Chew, Olaf Beyersdorff
On Unification of QBF Resolution-Based Calculi. Electron. Colloquium Comput. Complex. 21 (2014)