{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:22:50Z","timestamp":1649164970944},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":10336,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1985,4]]},"DOI":"10.1016\/0743-1066(85)90005-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"67-75","source":"Crossref","is-referenced-by-count":9,"title":["Top-down semantics of fair computations of logic programs"],"prefix":"10.1016","volume":"2","author":[{"given":"M.H.van","family":"Emden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Nait Abdallah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(85)90005-6_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\/0743-1066(85)90005-6_BIB2","first-page":"252","article-title":"Dataflow, Flowcharts, and \u201cLUCID\u201d-style Programming in Logic","author":"Brough","year":"1984","journal-title":"Proc. IEEE Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(85)90005-6_BIB3","series-title":"General Topology","author":"Bourbaki","year":"1966"},{"key":"10.1016\/0743-1066(85)90005-6_BIB4","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(85)90005-6_BIB5","series-title":"Research Monograph 79\u29f859","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0743-1066(85)90005-6_BIB6","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(85)90005-6_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Chaotic Semantics of Programming Logic","author":"Lassez","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(85)90005-6_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02485827","article-title":"A Compactification of the Algebra of Terms","volume":"6","author":"Mycielski","year":"1976","journal-title":"Algebra Universalis"},{"key":"10.1016\/0743-1066(85)90005-6_BIB9","series-title":"Research Report CS-82-19","article-title":"Sort Theory","author":"Nait Abdallah","year":"1982"},{"key":"10.1016\/0743-1066(85)90005-6_BIB10","series-title":"Research Report CS-83-29","article-title":"Metric Interpretation and Greatest Fixpoint Semantics of Logic Programs","author":"Nait Abdallah","year":"1983"},{"key":"10.1016\/0743-1066(85)90005-6_BIB11","doi-asserted-by":"crossref","unstructured":"Nait Abdallah, M.A., On the Interpretation of Infinite Computations in Logic Programming, ICALP 84, Springer LNCS 172, pp. 358-370.","DOI":"10.1007\/3-540-13345-3_32"},{"key":"10.1016\/0743-1066(85)90005-6_BIB12","first-page":"5","article-title":"Algorithmes Universels","volume":"2","author":"Nolin","year":"1974","journal-title":"RAIRO Theoretical Computer Science"},{"key":"10.1016\/0743-1066(85)90005-6_BIB13","first-page":"169","article-title":"Outline of a Mathematical Theory of Computation","author":"Scott","year":"1970","journal-title":"4th Annual Princeton Conference on Information Science and Systems"},{"key":"10.1016\/0743-1066(85)90005-6_BIB14","unstructured":"Tiuryn, J., unpublished letter dated 13 January 1979."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:25:59Z","timestamp":1580883959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106685900056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["0743106685900056"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(85)90005-6","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}