{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:20Z","timestamp":1747548320136},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"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":5015,"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":[[1999,11]]},"DOI":"10.1016\/s0004-3702(99)00074-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"25-64","source":"Crossref","is-referenced-by-count":16,"title":["The size of a revised knowledge base"],"prefix":"10.1016","volume":"115","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco M.","family":"Donini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Liberatore","sequence":"additional","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(99)00074-0_ID004","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"},{"issue":"4","key":"10.1016\/S0004-3702(99)00074-0_ID005","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/319628.319634","article-title":"Update semantics of relational views","volume":"6","author":"Bancilhon","year":"1981","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0004-3702(99)00074-0_ID006","series-title":"Handbook of Theoretical Computer Science, Vol. A","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/S0004-3702(99)00074-0_ID007","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(99)00074-0_ID008","series-title":"Proc. 14th ACM SIGACT SIGMOD SIGART 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(99)00074-0_ID009","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(96)00182-X","article-title":"On compact representations of propositional circumscription","volume":"182","author":"Cadoli","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(99)00074-0_ID010","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"475","article-title":"Investigations into a theory of knowledge base revision: Preliminary report","author":"Dalal","year":"1988"},{"key":"10.1016\/S0004-3702(99)00074-0_ID011","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"},{"issue":"3","key":"10.1016\/S0004-3702(99)00074-0_ID012","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1006\/jcss.1996.0083","article-title":"The complexity of nested counterfactuals and iterated knowledge base revisions","volume":"53","author":"Eiter","year":"1996","journal-title":"J. Computer and System Sci."},{"key":"10.1016\/S0004-3702(99)00074-0_ID013","series-title":"Proc. Second 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(99)00074-0_ID014","series-title":"Proc. IJCAI-89, Detroit, MI","first-page":"1273","article-title":"Introducing actions into qualitative simulation","author":"Forbus","year":"1989"},{"key":"10.1016\/S0004-3702(99)00074-0_ID015","series-title":"Knowledge in Flux: Modeling the Dynamics of Epistemic States","author":"G\u00e4rdenfors","year":"1988"},{"key":"10.1016\/S0004-3702(99)00074-0_ID016","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4","first-page":"35","article-title":"Belief revision","author":"G\u00e4rdenfors","year":"1995"},{"key":"10.1016\/S0004-3702(99)00074-0_ID017","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(99)00074-0_ID018","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0004-3702(86)90067-6","article-title":"Conterfactuals","volume":"30","author":"Ginsberg","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00074-0_ID019","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1613\/jair.380","article-title":"Incremental recompilation of knowledge","volume":"8","author":"Gogic","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(99)00074-0_ID020","series-title":"Handbook of Theoretical Computer Science, Vol. A","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(99)00074-0_ID021","series-title":"Proc. 12th ACM Symposium on Theory of Computing (STOC-80)","first-page":"302","article-title":"Some connections between non-uniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0004-3702(99)00074-0_ID022","series-title":"Proc. Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA","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(99)00074-0_ID023","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"786","article-title":"Forming concepts for fast inference","author":"Kautz","year":"1992"},{"key":"10.1016\/S0004-3702(99)00074-0_ID024","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3","first-page":"397","article-title":"Uncertainty logics","author":"Kyburg","year":"1994"},{"key":"10.1016\/S0004-3702(99)00074-0_ID025","series-title":"Proc. AAAI-96, Portland, OR","first-page":"556","article-title":"The complexity of model checking for belief revision and update","author":"Liberatore","year":"1996"},{"key":"10.1016\/S0004-3702(99)00074-0_ID026","series-title":"Proc. Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA","first-page":"417","article-title":"Belief revision and default reasoning: Syntax-based approaches","author":"Nebel","year":"1991"},{"key":"10.1016\/S0004-3702(99)00074-0_ID027","series-title":"Proc. 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam","first-page":"341","article-title":"Base revision operations and schemes: Semantics, representation and complexity","author":"Nebel","year":"1994"},{"key":"10.1016\/S0004-3702(99)00074-0_ID028","series-title":"Proc. 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(99)00074-0_ID029","series-title":"Proc. First Conference on Expert Database Systems","first-page":"487","article-title":"Updating propositional formulas","author":"Weber","year":"1986"},{"key":"10.1016\/S0004-3702(99)00074-0_ID030","series-title":"Updating Logical Databases","author":"Winslett","year":"1990"},{"key":"10.1016\/S0004-3702(99)00074-0_ID031","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4","first-page":"133","article-title":"Epistemic aspects of databases","author":"Winslett","year":"1995"},{"key":"10.1016\/S0004-3702(99)00074-0_ID032","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of non-uniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000740?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000740?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T15:16:25Z","timestamp":1580915785000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370299000740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0004370299000740"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(99)00074-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}