{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T05:56:36Z","timestamp":1713938196113},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"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":9087,"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":[[1988,9]]},"DOI":"10.1016\/0743-1066(88)90013-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"263-276","source":"Crossref","is-referenced-by-count":16,"title":["Complete logic programs with domain-closure axiom"],"prefix":"10.1016","volume":"5","author":[{"given":"Paolo","family":"Mancarella","sequence":"first","affiliation":[]},{"given":"Simone","family":"Martini","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(88)90013-1_BIB1","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(88)90013-1_BIB2","first-page":"500","article-title":"Completeness of the Negation-as-Failure Rule","author":"Jaffar","year":"1983","journal-title":"Proceedings of the 8th International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90013-1_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","article-title":"A Theory of Complete Logic Programs with Equality","volume":"3","author":"Jaffar","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB4","series-title":"Logic Programming: Relations, Functions and Equations","article-title":"A Logic Programming Language Scheme","author":"Jaffar","year":"1985"},{"key":"10.1016\/0743-1066(88)90013-1_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","article-title":"Canonical Logic Programs","volume":"2","author":"Jaffar","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB6","series-title":"Unification Revisited","author":"Lassez","year":"1986"},{"key":"10.1016\/0743-1066(88)90013-1_BIB7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A Basis for Deductive Data Base Systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","article-title":"A Basis for Deductive Data Base Systems. II","volume":"3","author":"Lloyd","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB9","article-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984","journal-title":"Springer Symbolic Computation Series"},{"key":"10.1016\/0743-1066(88)90013-1_BIB10","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(88)90013-1_BIB11","first-page":"858","article-title":"Logic Semantics for a Class of Committed-Choice Programs","author":"Maher","year":"1987","journal-title":"Proceedings of the Fourth International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB12","series-title":"Technical Report","article-title":"Complete Axiomatizations of the Algebras of Finite, Infinite and Rational Trees","author":"Maher","year":"1987"},{"key":"10.1016\/0743-1066(88)90013-1_BIB13","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 Data Base and Reiter's Closed World Assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90013-1_BIB14","first-page":"263","article-title":"A Unified Treatment of Resolution Strategies for Logic Programs","author":"Wolfram","year":"1984","journal-title":"Proceedings of the Second International Conference on Logic Programming"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900131?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:01Z","timestamp":1555127701000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106688900131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0743106688900131"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(88)90013-1","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}