Leroy Chew

According to our database, Leroy Chew authored at least 33 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Better Extension Variables in DQBF via Independence.

Leroy Chew, Tomás Peitl

Proceedings of the 28th International Conference on Theory and Applications of Satisfiability Testing, 2025

An Expansion-Based Approach for Quantified Integer Programming.

Michael Hartisch, Leroy Chew

Proceedings of the 31st International Conference on Principles and Practice of Constraint Programming, 2025

Proof Simulation via Round-based Strategy Extraction for QBF.

Leroy Chew

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP.

Leroy Chew, Alexis de Colnet, Stefan Szeider

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Circuits, Proofs and Propositional Model Counting.

Sravanthi Chede, Leroy Chew, Anil Shukla

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.

Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Dataset of Random Reordered Encodings of Parity Problems.

Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider

Dataset, December, 2023

Understanding Nullstellensatz for QBFs.

Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla

Electron. Colloquium Comput. Complex., 2023

2022

Towards Uniform Certification in QBF.

Leroy Chew, Friedrich Slivovsky

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Relating Existing Powerful Proof Systems for QBF.

Leroy Chew, Marijn J. H. Heule

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2021

Avoiding Monochromatic Rectangles Using Shift Patterns.

Zhenjun Liu, Leroy Chew, Marijn J. H. Heule

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Hardness and Optimality in QBF Proof Systems Modulo NP.

Leroy Chew

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020

Frege Systems for Quantified Boolean Logic.

Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich

J. ACM, 2020

Relating existing powerful proof systems for QBF.

Leroy Chew

Electron. Colloquium Comput. Complex., 2020

Sorting Parity Encodings by Reusing Variables.

Leroy Chew, Marijn J. H. Heule

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

How QBF Expansion Makes Strategy Extraction Hard.

Leroy Chew, Judith Clymo

Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019

New Resolution-Based QBF Calculi and Their Proof Complexity.

Olaf Beyersdorff, Leroy Chew, Mikolás Janota

ACM Trans. Comput. Theory, 2019

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF.

Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate A. Schmidt, Martin Suda

J. Autom. Reason., 2019

The Equivalences of Refutational QRAT.

Leroy Chew, Judith Clymo

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Short Proofs in QBF Expansion.

Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

ACM Trans. Comput. Log., 2018

2017

QBF proof complexity.

Leroy Nicholas Chew

PhD thesis, 2017

2016

Are Short Proofs Narrow? QBF Resolution is not Simple.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Lifting QBF Resolution Calculi to DQBF.

Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Lower Bounds: From Circuits to QBF Proof Systems.

Olaf Beyersdorff, Ilario Bonacina, Leroy Chew

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Understanding Cutting Planes for QBFs.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Extension Variables in QBF Resolution.

Olaf Beyersdorff, Leroy Chew, Mikolas Janota

Proceedings of the Beyond NP, 2016

2015

Proof Complexity of Resolution-based QBF Calculi.

Olaf Beyersdorff, Leroy Chew, Mikolás Janota

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

A Game Characterisation of Tree-like Q-resolution Size.

Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah

Proceedings of the Language and Automata Theory and Applications, 2015

Feasible Interpolation for QBF Resolution Calculi.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Tableau vs. Sequent Calculi for Minimal Entailment.

Olaf Beyersdorff, Leroy Chew

Electron. Colloquium Comput. Complex., 2014

On Unification of QBF Resolution-Based Calculi.

Olaf Beyersdorff, Leroy Chew, Mikolas Janota

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

The Complexity of Theorem Proving in Circumscription and Minimal Entailment.

Olaf Beyersdorff, Leroy Chew

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014