Items where authors include "Chew, L"

Article

Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J, Chew, L et al. (2 more authors) (2019) Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning, 63 (3). pp. 597-623. ISSN 0168-7433

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2019) A game characterisation of tree-like Q-Resolution size. Journal of Computer and System Sciences, 104. pp. 82-101. ISSN 0022-0000

Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2018) Understanding cutting planes for QBFs. Information and Computation, 262 (1). pp. 141-161. ISSN 0890-5401

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2018) Are Short Proofs Narrow? QBF Resolution is not so Simple. ACM Transactions on Computational Logic, 19 (1). 1. ISSN 1529-3785

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2017) Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science, 13 (2). 7. ISSN 1860-5974

Proceedings Paper

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2016) Understanding Cutting Planes for QBFs. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 13-15 Dec 2016, Chennai, India. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing , pp. 1-15.

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Schmidt, RA et al. (1 more author) (2016) Lifting QBF Resolution Calculi to DQBF. In: Theory and Applications of Satisfiability Testing – SAT 2016 ( Lecture Notes in Computer Science ). 19th International Conference on Theory and Applications of Satisfiability Testing, 05-08 Jul 2016, Bordeaux, France. Springer Verlag , pp. 490-499. ISBN 978-3-319-40969-6

Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2016) Are Short Proofs Narrow? QBF Resolution is not Simple. In: Ollinger, N and Vollmer, H, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS'16). Symposium on Theoretical Aspects of Computer Science (STACS'16), 17-20 Feb 2016, Orleans, France. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-001-9

Beyersdorff, O, Bonacina, I and Chew, L (2016) Lower bounds: from circuits to QBF proof systems. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ITCS '16, 14-16 Jan 2016, Cambridge, Massachusetts, USA. ACM , pp. 249-260. ISBN 978-1-4503-4057-1

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Janota, M (2016) Extension Variables in QBF Resolution. In: AAAI Workshop: Beyond NP. AAAI-16 workshop on Beyond NP, 12-13 Feb 2016, Phoenix, Arizona USA. Association for the Advancement of Artificial Intelligence .

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2015) Feasible interpolation for QBF resolution calculi. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15). 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 06-10 Jul 2015, Kyoto, Japan. Springer Verlag , pp. 180-192.

Beyersdorff, O, Chew, L and Janota, M (2015) Proof complexity of resolution-based QBF calculi. In: LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15). 32nd International Symposium on Theoretical Aspects of Computer Science, 04 Mar 2015. Schloss Dagstuhl - Leibniz International Proceedings in Informatics , 76 - 89. ISBN 9783939897781

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2015) A game characterisation of tree-like Q-resolution size. In: Dediou, A-H, Formenti, E, Martín-Vide, C and Truthe, B, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. LATA'15, 02-06 Mar 2015, Nice, France. Springer , pp. 486-498. ISBN 978-3-319-15579-1

Beyersdorff, O orcid.org/0000-0002-2870-1648 and Chew, L (2014) The complexity of theorem proving in circumscription and minimal entailment. In: Demri, S, Kapur, D and Weidenbach, C, (eds.) Automated Reasoning 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. 7th International Joint Conference, IJCAR 2014, 19-22 Jul 2014, Vienna, Austria. Lecture Notes in Computer Science , 8562 L . Springer , pp. 403-417. ISBN 978-3-319-08586-9

Beyersdorff, O, Chew, L and Janota, M (2014) On unification of QBF resolution-based calculi. In: Csuhaj-Varjú, E, Dietzfelbinger, M and Ésik, Z, (eds.) Mathematical Foundations of Computer Science 2014 39th International Symposium, MFCS 2014, Part II, Proceedings. 39th International Symposium, MFCS 2014, 25-29 Aug 2014, Budapest, Hungary. Springer , 81 - 93. ISBN 978-3-662-44464-1