{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:42:38Z","timestamp":1757540558662},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90128-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"15-25","source":"Crossref","is-referenced-by-count":28,"special_numbering":"C","title":["Optimal fixedpoints of logic programs"],"prefix":"10.1016","volume":"39","author":[{"given":"J.-L.","family":"Lassez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.J.","family":"Maher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90128-8_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90128-8_BIB2","series-title":"Proc. 1st Internat. Logic Programming Conf.","article-title":"The undecidability of two completeness notions for the negation as failure rule in logic programming","author":"Blair","year":"1982"},{"key":"10.1016\/0304-3975(85)90128-8_BIB3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90128-8_BIB4","series-title":"Logic Programming: Relations, Functions and Equations","article-title":"A logic programming language scheme","author":"Jaffar","year":"1985"},{"key":"10.1016\/0304-3975(85)90128-8_BIB5","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(85)90128-8_BIB6","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/0304-3975(85)90128-8_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures and fairness in the semantics of programming logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90128-8_BIB8","series-title":"Proc. American National Conf. on Artificial Intelligence","article-title":"The denotational semantics of Horn clauses as a production system","author":"Lassez","year":"1983"},{"key":"10.1016\/0304-3975(85)90128-8_BIB9","unstructured":"J.-L. Lassez and M.J. Maher, The semantics of logic programs, In preparation."},{"key":"10.1016\/0304-3975(85)90128-8_BIB10","first-page":"169","article-title":"O logice tr\u00f2jwartos\u0300ciowej","volume":"5","author":"Lukasiewicz","year":"1920","journal-title":"Ruch Filozoficzny"},{"key":"10.1016\/0304-3975(85)90128-8_BIB11","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0304-3975(85)90128-8_BIB12","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/0205033","article-title":"The theoretical aspects of the optimal fixedpoint","volume":"5","author":"Manna","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90128-8_BIB13","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/359863.359885","article-title":"The optimal approach to recursive programs","volume":"20","author":"Manna","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(85)90128-8_BIB14","series-title":"Perspectives on Computer Science","article-title":"A new approach to recursive programs","author":"Manna","year":"1977"},{"key":"10.1016\/0304-3975(85)90128-8_BIB15","series-title":"Proc. 1st STACS Conf.","article-title":"Logic programs and many-valued logic","author":"Mycroft","year":"1983"},{"key":"10.1016\/0304-3975(85)90128-8_BIB16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2307\/2370324","article-title":"Introduction to a general theory of elementary propositions","volume":"43","author":"Post","year":"1921","journal-title":"Amer. J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:57Z","timestamp":1553172777000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":16,"alternative-id":["0304397585901288"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90128-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}