{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:32:45Z","timestamp":1725895965786},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201684"},{"type":"electronic","value":"9783642201691"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20169-1_10","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:21:04Z","timestamp":1301289664000},"page":"150-166","source":"Crossref","is-referenced-by-count":0,"title":["Term Graphs and the NP-Completeness of the Product-Free Lambek Calculus"],"prefix":"10.1007","author":[{"given":"Timothy A. D.","family":"Fowler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Savateev, Y.: Product-free lambek calculus is NP-complete. CUNY Technical Report (September 2008)","DOI":"10.1007\/978-3-540-92687-0_26"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly\u00a065(3), 154\u2013170 (1958)","journal-title":"American Mathematical Monthly"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"648","DOI":"10.2307\/2275553","volume":"62","author":"M. Pentus","year":"1997","unstructured":"Pentus, M.: Product-free lambek calculus and context-free grammars. The Journal of Symbolic Logic\u00a062(2), 648\u2013660 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"10_CR4","unstructured":"Tiede, H.J.: Deductive Systems and Grammars: Proofs as Grammatical Structures. PhD thesis, Indiana University (1999)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Fowler, T.: Efficient parsing with the Product-Free lambek calculus. In: Proceedings of The 22nd International Conference on Computational Linguistics (2008)","DOI":"10.3115\/1599081.1599109"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-14322-9_4","volume-title":"The Mathematics of Language","author":"T. Fowler","year":"2010","unstructured":"Fowler, T.: A polynomial time algorithm for parsing with the bounded order lambek calculus. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 10. LNCS, vol.\u00a06149, pp. 36\u201343. Springer, Heidelberg (2010)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/S1571-0661(05)82589-7","volume":"53","author":"G. Penn","year":"2004","unstructured":"Penn, G.: A graph-theoretic approach to sequent derivability in the lambek calculus. Electronic Notes in Theoretical Computer Science\u00a053, 274\u2013295 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45653-8_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Perrier","year":"2001","unstructured":"Perrier, G.: Intuitionistic multiplicative proof nets as models of directed acyclic graph descriptions. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 233\u2013248. Springer, Heidelberg (2001)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Lamarche, F.: From proof nets to games. Electronic Notes in Theoretical Computer Science 3 (1996)","DOI":"10.1016\/S1571-0661(05)80409-8"},{"key":"10_CR10","volume-title":"Proceedings of Formal Grammar \u201901 and the 7th Meeting on Mathematics of Language","author":"G. Penn","year":"2001","unstructured":"Penn, G.: A Graph-Theoretic approach to sequent derivability in the lambek calculus. In: Proceedings of Formal Grammar \u201901 and the 7th Meeting on Mathematics of Language. Helsinki, Finland (2001)"},{"key":"10_CR11","unstructured":"Lamarche, F.: Proof nets for intuitionistic linear logic: Essential nets. Technical Report 00347336, INRIA (2008)"},{"key":"10_CR12","unstructured":"Roorda, D.: Resource logics: proof-theoretical investigations. PhD thesis, Universiteit van Amsterdam (1991)"},{"issue":"1-2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3975(98)00309-0","volume":"224","author":"P. Groote de","year":"1999","unstructured":"de Groote, P.: An algebraic correctness criterion for intuitionistic multiplicative proof-nets. Theoretical Computer Science\u00a0224(1-2), 115\u2013134 (1999)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20169-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:22:18Z","timestamp":1558513338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20169-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201684","9783642201691"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20169-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}