{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:01Z","timestamp":1725493441224},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:28:09Z","timestamp":1184603289000},"page":"320-336","source":"Crossref","is-referenced-by-count":5,"title":["Focusing and Proof-Nets in Linear and Non-commutative Logic"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Andreoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Maieli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"M. Abrusci and P. Ruet. Non commutative logic I: the multiplicative fragment, 1998. to appear in the Annals of Pure and Applied Logic.","key":"20_CR1","DOI":"10.1016\/S0168-0072(99)00014-7"},{"doi-asserted-by":"crossref","unstructured":"J-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 1992.","key":"20_CR2","DOI":"10.1093\/logcom\/2.3.297"},{"doi-asserted-by":"crossref","unstructured":"J-M. Andreoli and R. Pareschi. LO and behold! concurrent structured processes. In Proc. of OOPSLA\/ECOOP\u201990, Ottawa, Canada, 1990.","key":"20_CR3","DOI":"10.1145\/97945.97953"},{"key":"20_CR4","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"},{"unstructured":"J-Y. Girard. On the meaning of logical rules I: syntax vs. semantics II: multiplicatives and additives, 1998. Preprint.","key":"20_CR5"},{"unstructured":"J-Y. Girard. Informal communication, 1999. presented at the TMR \u201cLinear\u201d workshop on Non-commutative Logic, Prascati, April 1999.","key":"20_CR6"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J.S. Hodas","year":"1994","unstructured":"J.S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 110(2):327\u2013365, 1994.","journal-title":"Journal of Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"D. Miller. Lexical scoping as universal quantification. In Proc. of the 6th International Conference on Logic Programming, Lisboa, Portugal, 1989.","key":"20_CR8","DOI":"10.1016\/0743-1066(89)90031-9"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D. Miller","year":"1996","unstructured":"D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201\u2013232, 1996.","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"C. Retor\u00e9. Pomset logic: A non-commutative extension of classical linear logic. In Proc. of TLCA\u2019 97, pages 300\u2013318, Nancy, France, 1997.","key":"20_CR11","DOI":"10.1007\/3-540-62688-3_43"},{"unstructured":"P. Ruet. Non commutative logic II: Sequent calculus and phase semantics, 1998. Preprint.","key":"20_CR12"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:51:32Z","timestamp":1587779492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}