{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:28Z","timestamp":1751983648274,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637004"},{"type":"electronic","value":"9783540696315"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052153","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:43:12Z","timestamp":1149655392000},"page":"96-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tree adjoining grammars in noncommutative linear logic"],"prefix":"10.1007","author":[{"given":"V. Michele","family":"Abrusci","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Fouquer\u00e9","sequence":"additional","affiliation":[]},{"given":"Jacqueline","family":"Vauzeilles","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"6_CR1","volume-title":"Technical Report MS-CIS-90-24, LINC LAB 170","author":"A. Abeill\u00e9","year":"1990","unstructured":"A. Abeill\u00e9, K. Bishop, S. Cote, and Y. Schabes. A lexicalized tree-adjoining grammar for english. Technical Report MS-CIS-90-24, LINC LAB 170, Computer Science Department, University of Pennsylvania, Philadelphia, PA, 1990."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/malq.19900360405","volume":"36","author":"M. Abrusci","year":"1990","unstructured":"M. Abrusci. Noncommutative intuitionnistic linear prepositional logic. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, 36:297\u2013318, 1990.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.2307\/2275485","volume":"56","author":"M. Abrusci","year":"1991","unstructured":"M. Abrusci. Phase semantics and sequent calculus for pure noncommutative classical linear prepositional logic. The Journal of Symbolic Logic, 56(4):1403\u20131451, 1991.","journal-title":"The Journal of Symbolic Logic"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M. Abrusci. Noncommutative proof nets. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, volume 222, pages 271\u2013296. Cambridge University Press, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.014"},{"key":"6_CR5","volume-title":"Technical Report 97-03","author":"M. Abrusci","year":"1997","unstructured":"M. Abrusci, C. Fouquer\u00e9, and J. Vauzeilles. Tree adjoining grammars in noncommutative linear logic. Technical Report 97-03, LIPN, Universit\u00e9 Paris-Nord, France, 1997. In submission."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"A.K. Joshi and S. Kulick. Partial proof trees, resource conscious logic and syntactic constraints. In (this volume), 1997.","DOI":"10.1007\/BFb0052149"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"A.K. Joshi, L.S. Levy, and M. Takahashi. Tree adjunct grammars. Journal of Computer and System Sciences, 10(1):136\u2013163, 1975.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Aravind Joshi and Yves Schabes. Tree-adjoining grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 3 \u2014 Beyond Words, chapter 2, pages 69\u2013124. Springer-Verlag, 1996.","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"6_CR10","volume-title":"Technical Report MS-CIS-85-18, LINC LAB 170","author":"A.S. Kroch","year":"1985","unstructured":"A.S. Kroch and A.K. Joshi. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-18, LINC LAB 170, Computer Science Department, University of Pennsylvania, Philadelphia, PA, 1985."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"J. Lambek. The mathematics of sentence structure. Am. Math. Monthly, 65:154\u2013169, 1958.","journal-title":"Am. Math. Monthly"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"G. Sundholm. Systems of deduction. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 1, pages 133\u2013188. D. Reidel Publishing Company, 1983.","DOI":"10.1007\/978-94-009-7066-3_2"},{"issue":"4","key":"6_CR13","first-page":"481","volume":"18","author":"K. Vijay-Shanker","year":"1992","unstructured":"K. Vijay-Shanker. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481\u2013517, 1992.","journal-title":"Computational Linguistics"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"K. Vijay-Shanker and A.K. Joshi. Some computational properties of tree adjoining grammars. In 23rd Meeting of the Association for Computational Linguistics, pages 82\u201393, 1985.","DOI":"10.3115\/981210.981221"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"K. Vijay-Shanker and D.J. Weir. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27:511\u2013545, 1994.","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"6_CR16","first-page":"591","volume":"19","author":"K. Vijay-Shanker","year":"1994","unstructured":"K. Vijay-Shanker and D.J. Weir. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591\u2013636, 1994.","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T19:56:47Z","timestamp":1674503807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052153"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637004","9783540696315"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0052153","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}