{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:20Z","timestamp":1761611060183},"reference-count":37,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5898,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0004-3702(97)00016-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:20:41Z","timestamp":1027581641000},"page":"261-296","source":"Crossref","is-referenced-by-count":15,"title":["Reducing belief revision to circumscription (and vice versa)"],"prefix":"10.1016","volume":"93","author":[{"given":"Paolo","family":"Liberatore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00016-7_BIB1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","article-title":"On the logic of theory change: partial meet contraction and revision functions","volume":"50","author":"Alchourr\u00f3n","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/4879.4995","article-title":"Language features for flexible handling of exceptions in information systems","volume":"10","author":"Borgida","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","article-title":"The complexity of model checking for circumscriptive formulae","volume":"44","author":"Cadoli","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(97)00016-7_BIB4","series-title":"Proceedings 14th ACM SIGACT SIGMOD S1GART Symposium on Principles of Database Systems (PODS-95)","first-page":"151","article-title":"The size of a revised knowledge base","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB5","series-title":"Proceedings 4th Israeli Symposium on Theory of Computing and Systems (ISTCS-96)","first-page":"100","article-title":"Feasibility and unfeasibility of off-line processing","author":"Cadoli","year":"1996"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB6","series-title":"Proceedings 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR-96)","article-title":"Comparing space efficiency of propositional knowledge representation formalisms","author":"Cadoli","year":"1996"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB7_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-59042-0_74","article-title":"On compact representations of propositional circumscription","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB7_2","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(96)00182-X","volume":"182","author":"Cadoli","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(97)00016-7_BIB7_3","series-title":"Proceedings 12th Symposium on Theoretical Aspects of Computer Science (STACS-95)","first-page":"205","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0004-3702(92)90051-X","article-title":"An efficient method for eliminating varying predicates from a circumscription","volume":"54","author":"Cadoli","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0022-0000(05)80004-2","article-title":"The complexity of propositional closed world reasoning and circumscription","volume":"48","author":"Cadoli","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(97)00016-7_BIB10","series-title":"Proceedings AAAI-88","first-page":"475","author":"Dalai","year":"1988"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB12","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0004-3702(89)90018-0","article-title":"Eliminating the fixed predicates from a circumscription","volume":"39","author":"de Kleer","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","article-title":"On the complexity of propositional knowledge base revision, updates and counterfactuals","volume":"57","author":"Eiter","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","article-title":"Propositional circumscription and extended closed world reasoning are \u03a0P2-complete","volume":"114","author":"Eiter","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(97)00016-7_BIB15","series-title":"Proceedings IJCAI-89","first-page":"1273","article-title":"Introducing actions into qualitative simulation","author":"Forbus","year":"1989"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB16","series-title":"Proceedings 2nd ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS-83)","first-page":"352","article-title":"On the semantics of updates in databases","author":"Fagin","year":"1983"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB17","author":"G\u00e4rdenfors","year":"1988"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0004-3702(86)90067-6","article-title":"Counterfactuals","volume":"30","author":"Ginsberg","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","article-title":"A circumscriptive theorem prover","volume":"39","author":"Ginsberg","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB20","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","article-title":"Results on translating defaults to circumscription","volume":"32","author":"Imielinski","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB22","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB23","series-title":"Proceedings IJCAI-89","first-page":"1413","article-title":"A unified view of propositional knowledge base updates","author":"Katsuno","year":"1989"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB24","series-title":"Proceedings 2nd International Conference on the Principles of Knowledge Representation and Reasoning (KR-91)","first-page":"387","article-title":"On the difference between updating a knowledge base and revising it","author":"Katsuno","year":"1991"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","article-title":"Propositional knowledge base revision and minimal change","volume":"52","author":"Katsuno","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB26","series-title":"Proceedings IJCAI-85","first-page":"121","article-title":"Computing circumscription","author":"Lifschitz","year":"1985"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB27","series-title":"Belief revision and update: complexity of model checking and their relative compactness","author":"Liberatore","year":"1996"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB28","series-title":"Proceedings AMI-96","first-page":"556","article-title":"The complexity of model checking for belief revision and update","author":"Liberatore","year":"1996"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB30","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/inco.1995.1005","article-title":"Computing circumscriptive databases. I: Theory and algorithms","volume":"116","author":"Nerode","year":"1995","journal-title":"Inform, and Comput."},{"key":"10.1016\/S0004-3702(97)00016-7_BIB31","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB32","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"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB33","series-title":"Proceedings International Conference on Fifth Generation Computer Systems (FGCS-88)","first-page":"455","article-title":"Nonmonotonic reasoning by minimal belief revision","author":"Satoh","year":"1988"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB34","series-title":"Proceedings IJCAI-89","first-page":"455","article-title":"Sometimes updates are circumscription","author":"Winslett","year":"1989"},{"key":"10.1016\/S0004-3702(97)00016-7_BIB35","author":"Winslett","year":"1990"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:59:06Z","timestamp":1556740746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0004370297000167"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00016-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}