{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:14:22Z","timestamp":1649135662169},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/s0304-3975(96)80712-2","type":"journal-article","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T20:51:29Z","timestamp":1172868689000},"page":"383-406","source":"Crossref","is-referenced-by-count":4,"title":["Iterative belief revision in extended logic programming"],"prefix":"10.1016","volume":"170","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Cartwright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)80712-2_BIB1","series-title":"Scenario semantics of extended logic programs","first-page":"334","author":"Alferes","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB2","series-title":"Dualities between alternative semantics for logic programming and nonmonotonic reasoning","first-page":"69","author":"Baral","year":"1991"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","article-title":"Paraconsistent logic programming","volume":"68","author":"Blair","year":"1989","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB4","series-title":"An assumption-based framework for nonmonotonic reasoning","first-page":"171","author":"Bondarenko","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB5","article-title":"A classification theory of semantics of normal logic programs: 1. Strong Properties","author":"Dix","year":"1994","journal-title":"Fund. Inform"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB6","series-title":"Semantics of logic programs: their intuitions and formal properties (an overview)","author":"Dix","year":"1995"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB7","series-title":"Reason maintenance and belief revision: foundations versus coherence theories","first-page":"29","author":"Doyle","year":"1992"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB8","series-title":"Negations as hypotheses: an abductive foundation for logic programming","first-page":"3","author":"Dung","year":"1991"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB9","series-title":"An argumentation semantics for logic programming with explicit negation","first-page":"615","author":"Dung","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","article-title":"An argumentation theoretic foundation for logic programming","volume":"22","author":"Dung","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of argument and its fundamental role in non-monotonic reasoning and logic programming and n-persion game","volume":"77","author":"Dung","year":"1995","journal-title":"Artif. Intelligence"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB12","series-title":"Abduction compared with negation by failure","first-page":"234","author":"Eshghi","year":"1989"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB13","year":"1992"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB14_1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","article-title":"The alternating fixpoint of logic programs with negation","author":"Van Gelder","year":"1993","journal-title":"J. Comput. and System Sci"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB14_2","first-page":"1","year":"1989"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB15","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"23","author":"Van Gelder","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB16","series-title":"Logical programs with classical negation","first-page":"579","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","article-title":"Representing actions and changes by logic programs","volume":"17","author":"Gelfond","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB18","series-title":"The acceptability semantics for logic programs","first-page":"504","author":"Kakas","year":"1994"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB19","series-title":"Logic programs with exceptions","first-page":"490","author":"Kowalski","year":"1990"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/0205033","article-title":"The theoretical aspects of the optimal fixedpoint","volume":"5","author":"Manna","year":"1976","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB21","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/359863.359885","article-title":"The optimal approach to recursive programs","volume":"20","author":"Manna","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(78)90033-6","article-title":"The convergence of functions at fixpoint of recursive definitions","volume":"6","author":"Manna","year":"1978","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB23","series-title":"Well founded semantics for logic programs with explicit negation","first-page":"102","author":"Pereira","year":"1992"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB24","series-title":"Optative reasoning with scenario semantics","first-page":"601","author":"Pereira","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB25","series-title":"Contradiction removal within well-founded semantics","first-page":"105","author":"Pereira","year":"1991"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB26","series-title":"Counterfactual reasoning based on revising assumptions","first-page":"566","author":"Pereira","year":"1991"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB27","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0743-1066(93)90032-C","article-title":"Non-monotonic reasoning with logic programming","volume":"17","author":"Pereira","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB28","series-title":"Diagnosis and debugging as contradiction removal","first-page":"316","author":"Pereira","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoreitcal fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(93)90090-X","article-title":"Skeptical reason maintenance and belief revision","volume":"61","author":"Witteveen","year":"1993","journal-title":"Artifi. Intelligence"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB31","series-title":"Revision by expansion in logic programs","author":"Witteveen","year":"1993"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB32","series-title":"Tractable argumentation semantics via iterative belief revision","first-page":"239","author":"You","year":"1994"},{"key":"10.1016\/S0304-3975(96)80712-2_BIB33","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(94)00023-Y","article-title":"On the equivalence of semantics for normal logic programs","volume":"22","author":"You","year":"1995","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596807122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596807122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T19:50:14Z","timestamp":1546977014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596807122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0304397596807122"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)80712-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}