Obserwuj
Leroy Chew
Leroy Chew
Post Doc, TU Wien
Brak zweryfikowanego adresu e-mail - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
792015
On unification of QBF resolution-based calculi
O Beyersdorff, L Chew, M Janota
International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014
612014
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
472016
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
International Colloquium on Automata, Languages, and Programming, 180-192, 2015
402015
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
332019
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
332017
Understanding cutting planes for QBFs
O Beyersdorff, L Chew, M Mahajan, A Shukla
Information and Computation 262, 141-161, 2018
212018
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
202019
Lifting QBF resolution calculi to DQBF
O Beyersdorff, L Chew, RA Schmidt, M Suda
International Conference on Theory and Applications of Satisfiability …, 2016
182016
Frege systems for quantified Boolean logic
O Beyersdorff, I Bonacina, L Chew, J Pich
Journal of the ACM (JACM) 67 (2), 1-36, 2020
132020
Extension variables in QBF resolution
O Beyersdorf, L Chew, M Janota
Workshops at the Thirtieth AAAI Conference on Artificial Intelligence, 2016
122016
QBF proof complexity
LN Chew
University of Leeds, 2017
82017
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
72019
Short proofs in QBF expansion
O Beyersdorff, L Chew, J Clymo, M Mahajan
International Conference on Theory and Applications of Satisfiability …, 2019
72019
Sorting parity encodings by reusing variables
L Chew, MJH Heule
International Conference on Theory and Applications of Satisfiability …, 2020
62020
Hardness and optimality in QBF proof systems modulo NP
L Chew
International Conference on Theory and Applications of Satisfiability …, 2021
52021
How QBF expansion makes strategy extraction hard
L Chew, J Clymo
International Joint Conference on Automated Reasoning, 66-82, 2020
52020
The equivalences of refutational QRAT
L Chew, J Clymo
International Conference on Theory and Applications of Satisfiability …, 2019
52019
Towards uniform certification in QBF
L Chew, F Slivovsky
39th International Symposium on Theoretical Aspects of Computer Science …, 2022
42022
The complexity of theorem proving in circumscription and minimal entailment
O Beyersdorff, L Chew
International Joint Conference on Automated Reasoning, 403-417, 2014
32014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20