{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:26:17Z","timestamp":1780068377457,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662530412","type":"print"},{"value":"9783662530429","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53042-9_3","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T09:36:04Z","timestamp":1470389764000},"page":"43-59","source":"Crossref","is-referenced-by-count":4,"title":["Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing"],"prefix":"10.1007","author":[{"given":"Vito Michele","family":"Abrusci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Maieli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1020560613199","volume":"71","author":"VM Abrusci","year":"2002","unstructured":"Abrusci, V.M.: Classical conservative extensions of Lambek calculus. Stud. Logica. 71(3), 277\u2013314 (2002)","journal-title":"Stud. Logica."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-662-47709-0_5","volume-title":"Logic, Language, Information, and Computation","author":"VM Abrusci","year":"2015","unstructured":"Abrusci, V.M., Maieli, R.: Cyclic multiplicative proof nets of linear logic with an application to language parsing. In: de Paiva, V., de Queiroz, R., Moss, L.S., Leivant, D., de Oliveira, A. (eds.) WoLLIC 2015. LNCS, vol. 9160, pp. 53\u201368. Springer, Heidelberg (2015)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0168-0072(99)00014-7","volume":"101","author":"VM Abrusci","year":"2000","unstructured":"Abrusci, V.M., Ruet, P.: Non-commutative logic I: the multiplicative fragment. Ann. Pure Appl. Logic 101(1), 29\u201364 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR4","unstructured":"Andreoli, J.-M., Pareschi, R.: From Lambek calculus to word-based parsing. In: Proceedings of Substructural Logic and Categorial Grammar Workshop, Munchen (1991)"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Logic 28, 181\u2013203 (1989)","journal-title":"Arch. Math. Logic"},{"key":"3_CR6","unstructured":"Danos, V.: La Logique Lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers processus de normalisation (principalment du \n            $$\\lambda $$\n          -calcul). Ph.D. thesis, Paris (1990)"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoret. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR8","unstructured":"Girard, J.-Y.: Proof-nets: the parallel syntax for proof theory. In: Logic and Algebra. Marcel Dekker (1996)"},{"key":"3_CR9","unstructured":"Girard, J.-Y.: Le point aveugle. Cours de Logique, vol. I, Vers la Perfection. Ed. Hermann, Paris (2006)"},{"key":"3_CR10","unstructured":"Hughes, D., van Glabbeek, R.: Proof nets for unit-free multiplicative-additive linear logic. In: Proceedings of IEEE LICS (2003)"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Amer. Math. Monthly 65, 154\u2013170 (1958)","journal-title":"Amer. Math. Monthly"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Laurent, L., Maieli, R.: Cut elimination for monomial MALL proof nets. In: Proceedings of IEEE LICS, Pittsburgh, USA, pp 486\u2013497 (2008)","DOI":"10.1109\/LICS.2008.31"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s001530100127","volume":"42","author":"R Maieli","year":"2003","unstructured":"Maieli, R.: A new correctness criterion for multiplicative non-commutative proof-nets. Arch. Math. Logic 42, 205\u2013220 (2003). Springer-Verlag","journal-title":"Arch. Math. Logic"},{"key":"3_CR14","unstructured":"Maieli, R.: Cut elimination for monomial proof nets of the purely multiplicative and additive fragment of linear logic. IAC-CNR Report, no. 140 (2\/2008). HAL Id: hal-01153910. \nhttps:\/\/hal.archives-ouvertes.fr\/hal-01153910"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-540-75560-9_27","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R Maieli","year":"2007","unstructured":"Maieli, R.: Retractile proof nets of the purely multiplicative and additive fragment of linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 363\u2013377. Springer, Heidelberg (2007)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-319-08918-8_22","volume-title":"Rewriting and Typed Lambda Calculi","author":"R Maieli","year":"2014","unstructured":"Maieli, R.: Construction of retractile proof structures. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 319\u2013333. Springer, Heidelberg (2014)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-642-31555-8_2","volume-title":"The Logic of Categorial Grammars","author":"R Moot","year":"2012","unstructured":"Moot, R., Retor\u00e9, C.: A logic for categorial grammars: Lambek\u2019s syntactic calculus. In: Moot, R., Retor\u00e9, C. (eds.) The Logic of Categorial Grammars. LNCS, vol. 6850, pp. 23\u201363. Springer, Heidelberg (2012)"},{"key":"3_CR18","unstructured":"Moot, R.: Proof nets for linguistic analysis. Ph.D. thesis. Utrecht University (2002)"},{"key":"3_CR19","unstructured":"Morrill, G.: Additive operators for polymorphism. In: Categorial Grammar: Logical Syntax, Semantics and Processing. Oxford University Press (2011)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53042-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T07:05:27Z","timestamp":1517900727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53042-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530412","9783662530429"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53042-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}