{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:21Z","timestamp":1749125181166,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631040"},{"type":"electronic","value":"9783540691402"}],"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\/3-540-63104-6_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:04:10Z","timestamp":1330297450000},"page":"222-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Resource-distribution via Boolean constraints"],"prefix":"10.1007","author":[{"given":"James","family":"Harland","sequence":"first","affiliation":[]},{"given":"David","family":"Pym","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"J.-M. Andreoli. Logic Programming with Focusing Proofs in Linear Logic. J. Logic Computat. 2(3), 1992.","DOI":"10.1093\/logcom\/2.3.297"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(94)00105-7","volume":"135","author":"D. Galmiche","year":"1994","unstructured":"D. Galmiche and G. Perrier. On proof normalization in Linear Logic, Theoret. Comp. Sci. 135, 67\u2013110, 1994.","journal-title":"Theoret. Comp. Sci."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1934","unstructured":"G. Gentzen. Untersuchungen \u00fcber das logische Schliessen. Math. Zeit. 39, 176\u2013210, 405\u2013431, 1934.","journal-title":"Math. Zeit."},{"key":"21_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. Theoret. Comp. Sci. 50, 1\u2013102, 1987.","journal-title":"Theoret. Comp. Sci."},{"key":"21_CR5","unstructured":"J.-Y. Girard. Proof-nets for Additives. Manuscript, 1994."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"J. Harland, D. Pym and M. Winikoff. Programming in Lygon: An Overview. Proc. AMAST'96, M. Wirsing and M. Nivat, editors, LNCS 1101, 391\u2013405, July, 1996.","DOI":"10.1007\/BFb0014329"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J. Hodas","year":"1994","unstructured":"J. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. Inform. and Computat. 110:2:327\u2013365, 1994.","journal-title":"Inform. and Computat."},{"key":"21_CR8","unstructured":"P. Lincoln and N. Shankar. Proof Search in First-order Linear Logic and Other Cut-free Proc. of the IEEE Symposium on Logic in Computer Science 281\u2013292, Paris, June, 1994."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"D. Miller. A multiple-conclusion meta-logic. Proc. of the IEEE Symposium on Logic in Computer Science 272\u2013281, Paris, June, 1994.","DOI":"10.1109\/LICS.1994.316062"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/logcom\/4.2.175","volume":"4","author":"D. Pym","year":"1994","unstructured":"D. Pym and J. Harland. A Uniform Proof-theoretic Investigation of Linear Logic Programming. J. Logic Computat. 4:2:175\u2013207, 1994.","journal-title":"J. Logic Computat."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"D. Pym and L. Wallen. Logic Programming via Proof-valued Computations. In: ALPUK92, Proc. 4th U.K. Conference on Logic Programming, K. Broda (editor), 253\u2013263. Springer-Verlag, Workshops in Computing Series, 1992.","DOI":"10.1007\/978-1-4471-3421-3_14"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00885763","volume":"12","author":"T. Tammet","year":"1994","unstructured":"T. Tammet. Proof Search Strategies in Linear Logic. J. Automat. Reas. 12:273\u2013304, 1994.","journal-title":"J. Automat. Reas."},{"key":"21_CR13","unstructured":"A. Troelstra. Lectures on Linear Logic. CSLI Lecture Notes No. 29, 1992."},{"key":"21_CR14","unstructured":"M. Winikoff and J. Harland. Implementing the Linear Logic Programming Language Lygon. Proc. ILPS'95 66\u201380, J. Lloyd (ed.), MIT Press, 1995."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-14"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63104-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:36:45Z","timestamp":1742600205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63104-6_21"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631040","9783540691402"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63104-6_21","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":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}