{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070960},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)00107-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"139-153","source":"Crossref","is-referenced-by-count":18,"title":["First-order linear logic without modalities is NEXPTIME-hard"],"prefix":"10.1016","volume":"135","author":[{"given":"P.","family":"Lincoln","sequence":"first","affiliation":[]},{"given":"A.","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(94)00107-3_BIB1","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","volume":"2","author":"Andreoli","year":"1992","journal-title":"J. Logic Computation"},{"key":"10.1016\/0304-3975(94)00107-3_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037173","article-title":"Linear objects: logical processes with built-in inheritance","volume":"9","author":"Andreoli","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0304-3975(94)00107-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00107-3_BIB4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/LICS.1991.151628","article-title":"Logic programming in a fragment of intuitionistic linear logic","author":"Hodas","year":"1991","journal-title":"Proc. 6th Ann. IEEE Symp. on Logic in Computer Science, Amsterdam"},{"key":"10.1016\/0304-3975(94)00107-3_BIB5","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)00107-3_BIB6","first-page":"200","article-title":"Horn programming in linear logic is NP-complete","author":"Kanovich","year":"1992","journal-title":"Proc. 7th Ann. IEEE Symp. on Logic in Computer Science, Santa Cruz, California"},{"key":"10.1016\/0304-3975(94)00107-3_BIB7","series-title":"Ph.D. Thesis","article-title":"Computational aspects of linear logic","author":"Lincoln","year":"1992"},{"key":"10.1016\/0304-3975(94)00107-3_BIB8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","article-title":"Decision problems for propositional linear logic","volume":"56","author":"Lincoln","year":"1992","journal-title":"Ann. Pure. Appl. Logic"},{"key":"10.1016\/0304-3975(94)00107-3_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0168-0072(93)90041-B","article-title":"Linearizing intuitionistic implication","volume":"60","author":"Lincoln","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(94)00107-3_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1994.316061","article-title":"Proof search in first order linear logic and other cut free sequent calculi","author":"Lincoln","year":"1994","journal-title":"Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, Paris"},{"key":"10.1016\/0304-3975(94)00107-3_BIB11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(94)00108-1","article-title":"Constant-only multiplicative linear logic is NP-complete","volume":"135","author":"Lincoln","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00107-3_BIB12","series-title":"Lecture Notes in Computer Science No.660","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56454-3_13","article-title":"The \u03c0-calculus as a theory in linear logic: preliminary results","author":"Miller","year":"1993"},{"key":"10.1016\/0304-3975(94)00107-3_BIB13","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/0304-3975(94)00107-3_BIB14","article-title":"Higher-order, linear, concurrent constraint programming","author":"Saraswat","year":"1993","journal-title":"Draft"},{"key":"10.1016\/0304-3975(94)00107-3_BIB15","series-title":"Current Trends in Theoretical Computer Science","first-page":"377","article-title":"A brief guide to linear logic","author":"Scedrov","year":"1993"},{"key":"10.1016\/0304-3975(94)00107-3_BIB16","series-title":"NATO Advanced Science Institute, Series F","article-title":"Linear logic and computation: a survey","author":"Scedrov","year":"1994"},{"key":"10.1016\/0304-3975(94)00107-3_BIB17","series-title":"Proc. 11th Intern. Conf. on Automated Deduction","first-page":"522","article-title":"Proof search in the intuitionistic sequent calculus","author":"Shankar","year":"1992"},{"key":"10.1016\/0304-3975(94)00107-3_BIB18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(84)90021-9","article-title":"Alternation and the computational complexity of logic programs","volume":"1","author":"Shapiro","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00107-3_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2273858","article-title":"Classifying the computational complexity of problems","volume":"52","author":"Stockmeyer","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)00107-3_BIB20","series-title":"CSLI Lecture Notes No. 29","article-title":"Lectures on linear logic","author":"Troelstra","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:54Z","timestamp":1555113114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594001073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594001073"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00107-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}