Items where Funder is John Templeton Foundation - DO NOT USE.

Export as [feed] Atom [feed] RSS
Group by: Grant number | Institution | No Grouping
Number of items: 38.

48138

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 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, 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, 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 and Pich, J (2016) Understanding Gentzen and Frege Systems for QBF. In: LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 05-08 Jul 2016, New York, NY, USA. ACM , pp. 146-155. ISBN 978-1-4503-4391-6

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

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 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 orcid.org/0000-0002-2870-1648, Hinde, L and Pich, J (2018) Reasons for Hardness in QBF Proof Systems. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). 37th IARCS Annual Conference (FSTTCS 2017), 11-15 Dec 2017, Kanpur, India. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 14:1-14:15. ISBN 978-3-95977-055-2

Gambino, N orcid.org/0000-0002-4257-3590 and Sattler, C (2017) The Frobenius condition, right properness, and uniform fibrations. Journal of Pure and Applied Algebra, 221 (12). pp. 3027-3068. ISSN 0022-4049

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Palmgren, E (2015) Introduction – from type theory and homotopy theory to univalent foundations. Mathematical Structures in Computer Science, 25 (05). pp. 1005-1009. ISSN 0960-1295

Gambino, N orcid.org/0000-0002-4257-3590 and Joyal, A (2017) On operads, bimodules and analytic functors. Memoirs of the American Mathematical Society, 249. 1184. ISSN 0065-9266

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Sojakova, K (2017) Homotopy-initial algebras in type theory. Journal of the ACM, 63 (6). ISSN 1535-9921

612638

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

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 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

EP/L024233/1

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 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, 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, 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 and Pich, J (2016) Understanding Gentzen and Frege Systems for QBF. In: LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 05-08 Jul 2016, New York, NY, USA. ACM , pp. 146-155. ISBN 978-1-4503-4391-6

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

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 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

EP/M01729X/1

Gambino, N orcid.org/0000-0002-4257-3590 and Sattler, C (2017) The Frobenius condition, right properness, and uniform fibrations. Journal of Pure and Applied Algebra, 221 (12). pp. 3027-3068. ISSN 0022-4049

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Palmgren, E (2015) Introduction – from type theory and homotopy theory to univalent foundations. Mathematical Structures in Computer Science, 25 (05). pp. 1005-1009. ISSN 0960-1295

Gambino, N orcid.org/0000-0002-4257-3590 and Joyal, A (2017) On operads, bimodules and analytic functors. Memoirs of the American Mathematical Society, 249. 1184. ISSN 0065-9266

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Sojakova, K (2017) Homotopy-initial algebras in type theory. Journal of the ACM, 63 (6). ISSN 1535-9921

FA8655-13-1-3038, 12.800

Gambino, N orcid.org/0000-0002-4257-3590 and Sattler, C (2017) The Frobenius condition, right properness, and uniform fibrations. Journal of Pure and Applied Algebra, 221 (12). pp. 3027-3068. ISSN 0022-4049

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Palmgren, E (2015) Introduction – from type theory and homotopy theory to univalent foundations. Mathematical Structures in Computer Science, 25 (05). pp. 1005-1009. ISSN 0960-1295

Gambino, N orcid.org/0000-0002-4257-3590 and Joyal, A (2017) On operads, bimodules and analytic functors. Memoirs of the American Mathematical Society, 249. 1184. ISSN 0065-9266

Awodey, S, Gambino, N orcid.org/0000-0002-4257-3590 and Sojakova, K (2017) Homotopy-initial algebras in type theory. Journal of the ACM, 63 (6). ISSN 1535-9921

S-000672

Burley, M orcid.org/0000-0002-7446-3564 (2017) Dislocating the Eschaton? Appraising Realized Eschatology. Sophia, 56 (3). pp. 435-452. ISSN 0038-1527

Burley, M (2015) "The End of Immortality!" Eternal Life and the Makropulos Debate. Journal of Ethics, 19 (3). pp. 305-321. ISSN 1382-4554

Burley, M (2016) Eternal Life as an Exclusively Present Possession: Perspectives from Theology and the Philosophy of Time. Sophia: International Journal of Philosophy and Traditions, 55 (2). pp. 145-161. ISSN 0038-1527

This list was generated on Fri May 3 04:11:34 2024 BST.