{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:12Z","timestamp":1761610392002,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3893,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80502-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Isolating Resource Consumption in Linear Logic Proof Search"],"prefix":"10.1016","volume":"70","author":[{"given":"Pablo","family":"L\u00f2pez","sequence":"first","affiliation":[]},{"given":"Ernesto","family":"Pimentel","sequence":"additional","affiliation":[]},{"given":"Joshua S.","family":"Hodas","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Polakow","sequence":"additional","affiliation":[]},{"given":"Lubomira","family":"Stoilova","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB1","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","author":"Andreoli","year":"1992","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0168-0072(00)00032-4","article-title":"Focusing and proof construction","volume":"107","author":"Andreoli","year":"2001","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(99)00173-5","article-title":"Efficient resource management for linear logic proof search","volume":"232","author":"Cervesato","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB4","unstructured":"Chang E., \u201cIktara in ConCert: Realizing a Certified Grid Computing Framework from a Programmer's Perspective,\u201d Master's thesis, School of Computer Science, Carnegie Mellon University (2002)."},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB5","article-title":"Resource distribution via boolean constraints","author":"Harland","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB6","unstructured":"Harland J. and M. Winikoff, Implementing the linear logic programming language Lygon, in: J. Lloyd, editor, Proceedings of the 1995 International Logic Programming Symposium, 1995, pp. 66\u201380."},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB7","unstructured":"Hodas, J. S., \u201cLogic Programming in Intuitionistic Linear Logic: Theory, Design and Implementation,\u201d Ph.D. thesis, University of Pennsylvania, Department of Computer and Information Science (1994). URL http:\/\/www.cs.hmc.edu\/~hodas\/papers\/"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Hodas, J. S., P. L\u00f3pez, J. Polakow, L. Stoilova and E. Pimentel, A Tag-Frame system of resource management for proof search in linear-logic programming, in: Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02), Lecture Notes in Computer Science (2002), to appear.","DOI":"10.1007\/3-540-45793-3_12"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Hodas, J. S. and D. Miller, Logic programming in a fragment of intuitionistic linear logic, Information and Computation 110 (1994), pp. 327\u2013365, extended abstract in the Proceedings of the Sixth Annual Symposium on Logic in Computer Science, Amsterdam, July 15\u201318, 1991.","DOI":"10.1006\/inco.1994.1036"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB10","unstructured":"Hodas, J. S., K. Watkins, N. Tamura, and K.-S. Kang, Efficient implementation of a linear logic programming language, in: Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998, pp. 145\u2013159."},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB11","doi-asserted-by":"crossref","unstructured":"L\u00f3pez P. and E. Pimentel, Resource management in linear logic proof search revisited, in: H. Ganzinger, D. McAllester and A. Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR'99), Lecture Notes in Artificial Intelligence 1705 (1999), pp. 304\u2013319.","DOI":"10.1007\/3-540-48242-3_19"},{"key":"10.1016\/S1571-0661(04)80502-4_NEWBIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:12Z","timestamp":1761609972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104805024"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80502-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Isolating Resource Consumption in Linear Logic Proof Search","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80502-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}