{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:04:00Z","timestamp":1648944240162},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8845,"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":[[1989,5]]},"DOI":"10.1016\/0743-1066(89)90017-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"269-297","source":"Crossref","is-referenced-by-count":7,"title":["A computable semantics for general logic programs"],"prefix":"10.1016","volume":"6","author":[{"given":"Mark","family":"Wallace","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(89)90017-4_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1986"},{"key":"10.1016\/0743-1066(89)90017-4_BIB2","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1977"},{"key":"10.1016\/0743-1066(89)90017-4_BIB3","series-title":"Proceedings of Logic Programming Workshop","first-page":"190","article-title":"IC-Prolog: Aspects of its Implementation","author":"Clark","year":"1980"},{"issue":"4","key":"10.1016\/0743-1066(89)90017-4_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantic for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0743-1066(89)90017-4_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","article-title":"Canonical Logic Programs","volume":"3","author":"Jaffar","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(89)90017-4_BIB6","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0743-1066(89)90017-4_BIB7","article-title":"Negation in Logic Programming","author":"Kunen","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(89)90017-4_BIB8","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","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(89)90017-4_BIB9","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0743-1066(89)90017-4_BIB10","series-title":"Proceedings of the Third International Conference on Logic Programming","first-page":"410","article-title":"Equivalences of Logic Programs","author":"Maher","year":"1986"},{"key":"10.1016\/0743-1066(89)90017-4_BIB11","series-title":"Tech. Rep. 82\/2","article-title":"An Introduction to Muprolog","author":"Naish","year":"1982"},{"issue":"1","key":"10.1016\/0743-1066(89)90017-4_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as Failure: A Comparison of Clark's Completed Database and Reiter's Closed World Assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(89)90017-4_BIB13","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/0743-1066(89)90017-4_BIB14","series-title":"Proceedings of the International Symposium on Logic Programming","first-page":"211","article-title":"A Prolog Technology Theorem Prover","author":"Stickel","year":"1984"},{"issue":"3","key":"10.1016\/0743-1066(89)90017-4_BIB15","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. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(89)90017-4_BIB16","series-title":"Proceedings of the 1987 Symposium on Logic Programming","first-page":"253","article-title":"Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Database","author":"Wallace","year":"1987"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106689900174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106689900174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:16Z","timestamp":1555127716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106689900174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0743106689900174"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(89)90017-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}