Leroy Chew

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Relating existing powerful proof systems for QBF2024-07-12Paper
Towards uniform certification in QBF2024-04-23Paper
Towards Uniform Certification in QBF
Logical Methods in Computer Science
2024-03-11Paper
How QBF expansion makes strategy extraction hard2022-11-09Paper
Hardness and optimality in QBF proof systems modulo NP2022-03-22Paper
Sorting parity encodings by reusing variables2021-04-07Paper
Avoiding Monochromatic Rectangles Using Shift Patterns2020-12-23Paper
Frege systems for quantified Boolean logic
Journal of the ACM
2020-11-11Paper
Short proofs in QBF expansion2020-05-20Paper
The equivalences of refutational QRAT2020-05-20Paper
New resolution-based QBF calculi and their proof complexity
ACM Transactions on Computation Theory
2019-12-16Paper
Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
Journal of Automated Reasoning
2019-09-02Paper
A game characterisation of tree-like Q-resolution size
Journal of Computer and System Sciences
2019-06-25Paper
Understanding cutting planes for QBFs
Information and Computation
2018-09-27Paper
Understanding cutting planes for QBFs2018-04-19Paper
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
ACM Transactions on Computational Logic
2018-03-22Paper
Are Short Proofs Narrow? QBF Resolution is not Simple.2018-01-24Paper
Feasible interpolation for QBF resolution calculi2017-06-22Paper
Proof complexity of resolution-based QBF calculi2017-01-24Paper
Lifting QBF resolution calculi to DQBF
Theory and Applications of Satisfiability Testing – SAT 2016
2016-09-05Paper
Lifting QBF resolution calculi to DQBF
Theory and Applications of Satisfiability Testing – SAT 2016
2016-09-05Paper
A game characterisation of tree-like Q-resolution size
Language and Automata Theory and Applications
2016-04-08Paper
Feasible interpolation for QBF resolution calculi
Automata, Languages, and Programming
2015-10-27Paper
On Unification of QBF Resolution-Based Calculi
Mathematical Foundations of Computer Science 2014
2014-10-14Paper
The complexity of theorem proving in circumscription and minimal entailment
Automated Reasoning
2014-09-26Paper


Research outcomes over time


This page was built for person: Leroy Chew