{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:31:09Z","timestamp":1649205069550},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"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":[[1994,1]]},"DOI":"10.1016\/0304-3975(94)90201-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"49-68","source":"Crossref","is-referenced-by-count":3,"title":["Adding closed world assumptions to well-founded semantics"],"prefix":"10.1016","volume":"122","author":[{"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Jos\u00e9J.","family":"Alferes","sequence":"additional","affiliation":[]},{"given":"Joaquim N.","family":"Apar\u00edcio","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90201-1_BIB1","series-title":"Logic Programming and NonMonotonic Reasoning","first-page":"166","article-title":"Classifying semantics of logic programs","author":"Dix","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB2","series-title":"Proc. 5th Internat. Conf. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0304-3975(94)90201-1_BIB3","series-title":"Logic Programming and Nonmonotonic Reasoning","first-page":"275","article-title":"Negation as stable hypothesis","author":"Kakas","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB4","series-title":"Proc. Internat. Logic Programming Symp.","first-page":"85","article-title":"Stable theories for logic programs","author":"Kakas","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB5","series-title":"Reading in Nonmonotonic Reasoning","first-page":"326","article-title":"On indefinite databases and the closed world assumption","author":"Minker","year":"1987"},{"key":"10.1016\/0304-3975(94)90201-1_BIB6","series-title":"Notes on the negation in logic programs","author":"Monteiro","year":"1992"},{"key":"10.1016\/0304-3975(94)90201-1_BIB7","series-title":"Logic Programming and Nonmonotonic Reasoning","first-page":"105","article-title":"Contradiction removal within well founded semantics","author":"Pereira","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB8","series-title":"Proc. 5th Portuguese AI Conf.","first-page":"105","article-title":"The extended stable models of contradiction removal semantics","volume":"Vol.541","author":"Pereira","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB9","series-title":"Proc. Internat. Logic Programming Symp.","first-page":"566","article-title":"Counterfactual reasoning based on revising assumptions","author":"Pereira","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB10","series-title":"Scandinavian Conf. on AI","article-title":"Hypothetical reasoning with well founded semantics","author":"Pereira","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB11","series-title":"Proc. 8th Internat. Conf. on Logic Programming","first-page":"475","article-title":"Nonmonotonic reasoning with well founded semantics","author":"Pereira","year":"1991"},{"key":"10.1016\/0304-3975(94)90201-1_BIB12","series-title":"Formal Techniques in Artificial Intelligence","first-page":"321","article-title":"Semantic issues in deductive databases and logic programs","author":"Przymusinska","year":"1990"},{"key":"10.1016\/0304-3975(94)90201-1_BIB13","series-title":"Proc. 7th Internat. Conf. on Logic Programming","first-page":"459","article-title":"Extended stable semantics for normal and disjunctive programs","author":"Przymusinski","year":"1990"},{"key":"10.1016\/0304-3975(94)90201-1_BIB14","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"van Gelder","year":"1991","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902011?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902011?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:34Z","timestamp":1555115134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0304397594902011"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90201-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}