Items where authors include "Blinkhorn, J"
Up a levelArticle
Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J and Mahajan, M (2021) Building Strategies into QBF Proofs. Journal of Automated Reasoning, 65 (2). pp. 125-154. ISSN 0168-7433
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
Proceedings Paper
Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J and Hinde, L (2018) Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. In: Karlin, AR, (ed.) LIPIcs : Leibniz International Proceedings in Informatics. 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 11-14 Jan 2018, Cambridge, MA, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-060-6
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2018) Genuine Lower Bounds for QBF Expansion. In: Niedermeier, R and Vallee, B, (eds.) Leibniz International Proceedings in Informatics (LIPIcs). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 12:1-12:15. ISBN 978-3-95977-062-0
Blinkhorn, J and Beyersdorff, O orcid.org/0000-0002-2870-1648 (2017) Shortening QBF Proofs with Dependency Schemes. In: Theory and Applications of Satisfiability Testing – SAT 2017 (Lecture Notes in Computer Science). International Conference on Theory and Applications of Satisfiability Testing, 28 Aug - 01 Sep 2017, Melbourne, Australia. Springer Nature , pp. 263-280. ISBN 978-3-319-66262-6
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2016) Dependency Schemes in QBF Calculi: Semantics and Soundness. In: Principles and Practice of Constraint Programming: Proceedings. 22nd International Conference (CP 2016), 05-09 Sep 2016, Toulouse, France. Lecture Notes in Computer Science (9892). Springer International Publishing , Cham, Switzerland , pp. 96-112. ISBN 978-3-319-44952-4