{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T07:50:24Z","timestamp":1687161024240},"reference-count":30,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.323.6","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T11:43:24Z","timestamp":1600083804000},"page":"84-94","source":"Crossref","is-referenced-by-count":3,"title":["Functorial Question Answering"],"prefix":"10.4204","volume":"323","author":[{"given":"Giovanni","family":"de Felice","sequence":"first","affiliation":[{"name":"University of Oxford"}]},{"given":"Konstantinos","family":"Meichanetzidis","sequence":"additional","affiliation":[{"name":"University of Oxford, Cambridge Quantum Computing Ltd."}]},{"given":"Alexis","family":"Toumi","sequence":"additional","affiliation":[{"name":"University of Oxford"}]}],"member":"2720","published-online":{"date-parts":[[2020,9,15]]},"reference":[{"key":"AbramskyShah18","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CSL.2018.2","article-title":"Relating Structure and Power: Comonadic Semantics for Computational Resources","author":"Abramsky","year":"2018","journal-title":"arXiv:1806.09031 [cs]"},{"key":"BagetMugnier02","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1613\/jair.918","article-title":"Extensions of Simple Conceptual Graphs: The Complexity of Rules and Constraints","volume":"16","author":"Baget","year":"2002","journal-title":"Journal of Artificial Intelligence Research"},{"key":"BonchiEtAl18","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CSL.2018.13","article-title":"Graphical Conjunctive Queries","author":"Bonchi","year":"2018","journal-title":"arXiv:1804.07626 [cs]"},{"key":"Bulatov17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37","article-title":"A Dichotomy Theorem for Nonuniform CSPs","author":"Bulatov","year":"2017","journal-title":"arXiv:1703.03021 [cs]"},{"key":"BuszkowskiMoroz08","article-title":"Pregroup Grammars and Context-Free Grammars","volume":"121","author":"Buszkowski","year":"2008","journal-title":"Computational Algebraic Approaches to Natural Language, Polimetrica"},{"issue":"1","key":"CarboniWalters87","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-4049(87)90121-6","article-title":"Cartesian Bicategories I","volume":"49","author":"Carboni","year":"1987","journal-title":"Journal of Pure and Applied Algebra"},{"key":"ChandraMerlin77","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/800105.803397","article-title":"Optimal Implementation of Conjunctive Queries in Relational Data Bases","volume-title":"Proceedings of the Ninth Annual ACM Symposium on Theory of Computing - STOC '77","author":"Chandra","year":"1977"},{"key":"ChekuriRajaraman00","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0","article-title":"Conjunctive Query Containment Revisited","author":"Chekuri","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"ClarkEtAl08","first-page":"133","article-title":"A Compositional Distributional Model of Meaning","volume-title":"Proceedings of the Second Symposium on Quantum Interaction (QI-2008)","author":"Clark","year":"2008"},{"key":"ClarkEtAl10","series-title":"Linguistic Analysis","first-page":"345","article-title":"Mathematical Foundations for a Compositional Distributional Model of Meaning","volume-title":"A Festschrift for Jim Lambek","volume":"36","author":"Clark","year":"2010"},{"key":"CoeckeEtAl18a","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.283.1","article-title":"Towards Compositional Distributional Discourse Analysis","volume":"283","author":"Coecke","year":"2018","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"CoeckeEtAl18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.03.008","article-title":"Generalized Relations in Linguistics & Cognition","author":"Coecke","year":"2018","journal-title":"Theoretical Computer Science"},{"key":"FongSpivak18a","article-title":"Graphical Regular Logic","author":"Fong","year":"2018","journal-title":"arXiv:1812.05765"},{"key":"GareyJohnson90","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"JoyalStreet88","article-title":"Planar Diagrams and Tensor Algebra","author":"Joyal","year":"1988"},{"key":"Lambek99","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(94)00063-9","article-title":"Type Grammar Revisited","volume-title":"Logical Aspects of Computational Linguistics","author":"Lambek","year":"1999"},{"key":"Lambek08","series-title":"Open Access Publications","volume-title":"From Word to Sentence: A Computational Algebraic Approach to Grammar","author":"Lambek","year":"2008"},{"key":"moroz2011","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-20169-1_9","article-title":"A Savateev-Style Parsing Algorithm for Pregroup Grammars","volume-title":"Formal Grammar","author":"Moroz","year":"2011"},{"key":"Patterson17","article-title":"Knowledge Representation in Bicategories of Relations","author":"Patterson","year":"2017","journal-title":"arXiv:1706.00526 [cs, math]"},{"key":"Preller07a","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11225-007-9087-0","article-title":"Linear Processing with Pregroups","volume":"87","author":"Preller","year":"2007","journal-title":"Studia Logica: An International Journal for Symbolic Logic"},{"key":"Preller14a","doi-asserted-by":"publisher","first-page":"113","DOI":"10.4204\/EPTCS.171.11","article-title":"From Logical to Distributional Models","volume":"171","author":"Preller","year":"2014","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"1","key":"Preller14","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.jal.2013.08.001","article-title":"Natural Language Semantics in Biproduct Dagger Categories","volume":"12","author":"Preller","year":"2014","journal-title":"J. Applied Logic"},{"issue":"2","key":"PrellerLambek07","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1017\/S0960129506005901","article-title":"Free Compact 2-Categories","volume":"17","author":"Preller","year":"2007","journal-title":"Mathematical Structures in Computer Science"},{"issue":"4","key":"PrellerSadrzadeh11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10849-011-9132-2","article-title":"Semantic Vector Models and Functional Models for Pregroup Grammars","volume":"20","author":"Preller","year":"2011","journal-title":"Journal of Logic, Language and Information"},{"key":"SadrzadehEtAl13","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1093\/logcom\/ext044","article-title":"The Frobenius Anatomy of Word Meanings I: Subject and Object Relative Pronouns","volume":"23","author":"Sadrzadeh","year":"2013","journal-title":"Journal of Logic and Computation"},{"issue":"4","key":"SadrzadehEtAl18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10472-017-9570-x","article-title":"Sentence Entailment in Compositional Distributional Semantics","volume":"82","author":"Sadrzadeh","year":"2018","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"selinger2010a","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12821-9_4","article-title":"A Survey of Graphical Languages for Monoidal Categories","author":"Selinger","year":"2009","journal-title":"arXiv:0908.3347"},{"key":"StefanoniEtAl18","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1145\/3178876.3186003","article-title":"Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation","volume-title":"Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018","author":"Stefanoni","year":"2018"},{"key":"Thomazo13","volume-title":"Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms","author":"Thomazo","year":"2013"},{"key":"ZengCoecke16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.4204\/EPTCS.221.8","article-title":"Quantum Algorithms for Compositional Natural Language Processing","volume":"221","author":"Zeng","year":"2016","journal-title":"Electronic Proceedings in Theoretical Computer Science"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:46:00Z","timestamp":1600735560000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1905.07408v3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,15]]},"references-count":30,"URL":"https:\/\/doi.org\/10.4204\/eptcs.323.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,15]]}}}