{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:31Z","timestamp":1761611071777},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0168-0072(94)90085-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"195-241","source":"Crossref","is-referenced-by-count":28,"title":["The complexity of Horn fragments of Linear Logic"],"prefix":"10.1016","volume":"69","author":[{"given":"Max I.","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)90085-X_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of linear logic","volume":"111","author":"Abramsky","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)90085-X_BIB2","first-page":"59","article-title":"Implicative formulae in the \u2018Proofs as Computations\u2019 Analogy","author":"Asperti","year":"1990","journal-title":"Proceedings of the 17th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0168-0072(94)90085-X_BIB3","author":"Garey","year":"1979","journal-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness"},{"key":"10.1016\/0168-0072(94)90085-X_BIB4","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\/0168-0072(94)90085-X_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","article-title":"Bounded linear logic: a modular approach to polynomial time computability","volume":"97","author":"Girard","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)90085-X_BIB6","article-title":"The multiplicative fragment of linear logic is NP-complete","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90085-X_BIB7","article-title":"The Horn fragment of linear logic is NP-complete","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90085-X_BIB8","first-page":"615","article-title":"Efficient program synthesis: semantics, logic, complexity","volume":"526","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90085-X_BIB9","article-title":"Fast theorem proving in intuitionistic propositional logic","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)90085-X_BIB10","first-page":"200","article-title":"Horn programming in linear logic is NP-complete","author":"Kanovich","year":"1992","journal-title":"Proceeding of the 7th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90085-X_BIB11_1","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\/0168-0072(94)90085-X_BIB11_2","first-page":"662","author":"Lincoln","year":"1990","journal-title":"Preliminary report in Proceedings of the 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0168-0072(94)90085-X_BIB12_1","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\/0168-0072(94)90085-X_BIB12_2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/LICS.1991.151630","author":"Lincoln","year":"1991","journal-title":"Preliminary report in Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0168-0072(94)90085-X_BIB13","article-title":"Constant multiplicative linear logic is NP-complete","author":"Lincoln","year":"1992","journal-title":"Draft"},{"key":"10.1016\/0168-0072(94)90085-X_BIB14","first-page":"1","article-title":"Event spaces and their linear logic","author":"Pratt","year":"1991"},{"key":"10.1016\/0168-0072(94)90085-X_BIB15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","article-title":"Intuitionistic propositional logic is polynomial-space complete","volume":"9","author":"Statman","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)90085-X_BIB16","article-title":"Lectures on linear logic","author":"Troelstra","year":"1992"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729490085X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729490085X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:55:48Z","timestamp":1555142148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729490085X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["016800729490085X"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)90085-x","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}