Leroy Chew
Leroy Chew
Research Fellow, University of Leeds
Dirección de correo verificada de leeds.ac.uk
Título
Citado por
Citado por
Año
Proof complexity of resolution-based QBF calculi
O Beyersdorff, L Chew, M Janota
LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15) 30, 76-89, 2015
702015
On unification of QBF resolution-based calculi
O Beyersdorff, L Chew, M Janota
International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014
512014
Lower bounds: From circuits to QBF proof systems
O Beyersdorff, I Bonacina, C Leroy
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
412016
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
International Colloquium on Automata, Languages, and Programming, 180-192, 2015
332015
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
O Beyersdorff, L Chew, M Mahajan, A Shukla
ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017
282017
A game characterisation of tree-like Q-resolution size
O Beyersdorff, L Chew, K Sreenivasaiah
Journal of Computer and System Sciences 104, 82-101, 2019
242019
Lifting QBF resolution calculi to DQBF
O Beyersdorff, L Chew, RA Schmidt, M Suda
International Conference on Theory and Applications of Satisfiability …, 2016
142016
Understanding cutting planes for QBFs
O Beyersdorff, L Chew, M Mahajan, A Shukla
Information and Computation 262, 141-161, 2018
132018
Extension variables in QBF resolution
O Beyersdorf, L Chew, M Janota
Workshops at the Thirtieth AAAI Conference on Artificial Intelligence, 2016
102016
Short proofs in QBF expansion
O Beyersdorff, L Chew, J Clymo, M Mahajan
International Conference on Theory and Applications of Satisfiability …, 2019
32019
QBF proof complexity
LN Chew
University of Leeds, 2017
32017
Reinterpreting dependency schemes: Soundness meets incompleteness in DQBF
O Beyersdorff, J Blinkhorn, L Chew, R Schmidt, M Suda
Journal of automated reasoning 63 (3), 597-623, 2019
22019
New Resolution-Based QBF Calculi and Their Proof Complexity
O Beyersdorff, L Chew, M Janota
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-42, 2019
22019
The complexity of theorem proving in circumscription and minimal entailment
O Beyersdorff, L Chew
International Joint Conference on Automated Reasoning, 403-417, 2014
22014
The Equivalences of Refutational QRAT
L Chew, J Clymo
International Conference on Theory and Applications of Satisfiability …, 2019
12019
Hardness and Optimality in QBF Proof Systems Modulo NP.
L Chew
Electronic Colloquium on Computational Complexity (ECCC) 25, 178, 2018
12018
Feasible Interpolation for QBF Resolution Calculi
A Shukla, M Mahajan, L Chew, O Beyersdorff
Logical Methods in Computer Science 13, 2017
2017
Tableau vs. Sequent Calculi for Minimal Entailment
O Beyersdorff, L Chew
arXiv preprint arXiv:1405.1565, 2014
2014
How QBF Expansion Makes Strategy Extraction Hard
L Chew, J Clymo
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–19