{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:32:27Z","timestamp":1648603947907},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0020-0190(92)90052-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"129-133","source":"Crossref","is-referenced-by-count":2,"title":["Relating minimal models and pre-requisite-free normal defaults"],"prefix":"10.1016","volume":"44","author":[{"given":"Jorge","family":"Lobo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90052-W_BIB1","series-title":"Computation and implementation of non-monotonic deductive databases","author":"Bell","year":"1991"},{"key":"10.1016\/0020-0190(92)90052-W_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(87)90081-6","article-title":"Formalizing non-monotonic reasoning systems","volume":"31","author":"Etherington","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(92)90052-W_BIB3","series-title":"Proc. 5th Internat. Conf.\/Symp. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0020-0190(92)90052-W_BIB4","series-title":"Proc. 1991 Internat. Conf. on Knowledge Representation","article-title":"Disjunctive defaults","author":"Gelfond","year":"1991"},{"key":"10.1016\/0020-0190(92)90052-W_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","article-title":"On the relationship between circumscription and negation as failure","volume":"38","author":"Gelfond","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(92)90052-W_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","article-title":"On the relation between default and autoepistemic logic","volume":"35","author":"Konolige","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(92)90052-W_BIB7","series-title":"Proc. 6th Internat. Conf. on Logic Programming","first-page":"600","article-title":"The relationship between logic program semantics and non-monotonic reasoning","author":"Marek","year":"1989"},{"key":"10.1016\/0020-0190(92)90052-W_BIB8","series-title":"Proc. 1989 North American Conf. on Logic Programming","first-page":"243","article-title":"Stable semantics for logic programs and default theories","author":"Marek","year":"1989"},{"key":"10.1016\/0020-0190(92)90052-W_BIB9","series-title":"Principles of Knowledge Representation and Reasoning","first-page":"276","article-title":"Relating autoepistemic and default logic","author":"Marek","year":"1989"},{"key":"10.1016\/0020-0190(92)90052-W_BIB10","first-page":"292","article-title":"On indefinite databases and the Closed World Assumption","volume":"138","author":"Minker","year":"1982"},{"key":"10.1016\/0020-0190(92)90052-W_BIB11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0743-1066(85)80002-9","article-title":"Computing protected circumscription","volume":"2","author":"Minker","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(92)90052-W_BIB12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","article-title":"A fixpoint semantics for non-Horn logic programs","volume":"9","author":"Minker","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(92)90052-W_BIB13","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, Stationary semantics for disjunctive logic programs and deductive databases, in: Proc. 1990 North American Conf. on Logic Programming.","DOI":"10.1007\/3-540-55015-1_5"},{"key":"10.1016\/0020-0190(92)90052-W_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290052W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290052W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:10:22Z","timestamp":1580901022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290052W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["002001909290052W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90052-w","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}