{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:54Z","timestamp":1725488514289},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_17","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"205-216","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Succinct Representations of Model Based Belief Revision"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"17_CR1","first-page":"563","volume":"10","author":"A. Borgida","year":"1981","unstructured":"A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10:563\u2013603, 1981.","journal-title":"ACM Transactions on Database Systems"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"44","author":"M. Cadoli","year":"1992","unstructured":"M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44:113\u2013118, 1992.","journal-title":"Information Processing Letters"},{"key":"17_CR3","unstructured":"M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. Comparing space efficiency of propositional knowledge representation formalisms. In Proc. of KR-96, pages 100\u2013109, 1996."},{"key":"17_CR4","first-page":"137","volume":"10","author":"M. Cadoli","year":"1998","unstructured":"M. Cadoli and F.M. Donini. A survey on knowledge compilation. AI Communications-The European Journal for Artificial Intelligence, 10:137\u2013150, 1998.","journal-title":"AI Communications-The European Journal for Artificial Intelligence"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"M. Cadoli, F.M. Donini, P. Liberatore, and M. Shaerf. The size of a revised knowledge base. In Proc. of PODS-95, pages 151\u2013162, 1995.","DOI":"10.1145\/212433.220205"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(96)00182-X","volume":"182","author":"M. Cadoli","year":"1995","unstructured":"M. Cadoli, F.M. Donini, M. Shaerf, and R. Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182:183\u2013202, 1995.","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cadoli","year":"1993","unstructured":"M. Cadoli and M. Shaerf. A survey on complexity results for nonmonotonic logics. Journal of Logic Programming, 17:127\u2013160, 1993.","journal-title":"Journal of Logic Programming"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","volume":"57","author":"T. Eiter","year":"1992","unstructured":"T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57:227\u2013270, 1992.","journal-title":"Artificial Intelligence"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are \u03a0\n                  2\n                  p\n                -complete. Theoretical Computer Science, 114:231\u2013245, 1993.","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/jcss.1996.0083","volume":"53","author":"T. Eiter","year":"1996","unstructured":"T. Eiter and G. Gottlob. The complexity of nested counterfactuals and iterated knowledge base revisions. Journal of Computer and System Sciences, 53:497\u2013512, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"R. Fagin, J.D. Ullman, and M.Y. Vardi. On the semantics of updates in databases. In Proc. of PODS-83, pages 352\u2013365, 1983.","DOI":"10.1145\/588058.588100"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0004-3702(86)90067-6","volume":"30","author":"M.L. Ginsberg","year":"1986","unstructured":"M.L. Ginsberg. Counterfactuals. Artificial Intelligence, 30:35\u201379, 1986.","journal-title":"Artificial Intelligence"},{"key":"17_CR13","unstructured":"G. Gogic, H. Kautz, C. Papadimitriou, and B. Selman. The comparative linguistics of knowledge representation. In Proc. of IJCAI-95, pages 862\u2013869, 1995."},{"key":"17_CR14","unstructured":"P. Liberatore and M. Shaerf. Relating belief revision and circumscription. In Proc. of IJCAI-95, pages 1557\u20131563, 1995."},{"key":"17_CR15","unstructured":"P. Liberatore and M. Shaerf. The complexity of model checking for belief revision and update. In Proc. of AAAI-96, pages 556\u2013561, 1996."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy. Circumscription \u2014 a form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence Journal"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence Journal, 28:89\u2013116, 1986.","journal-title":"Artificial Intelligence Journal"},{"key":"17_CR18","unstructured":"B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In Proc. of KR-91, pages 417\u2013428, 1991."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"B. Nebel. How hard is it to revise a belief base? In Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 3: Belief Change, pages 77\u2013145, 1998.","DOI":"10.1007\/978-94-011-5054-5_3"},{"key":"17_CR20","unstructured":"C.H. Papadimitriou. Computational complexity. Addison Wesley, 1993."},{"key":"17_CR21","unstructured":"K. Satoh. Nonmonotonic reasoning by minimal belief revision. In Proc. of FGCS-88, pages 455\u2013462, 1988."},{"key":"17_CR22","unstructured":"A. Weber. Updating propositional formulas. In Proc. of the First Conference on Expert Database Systems, pages 487\u2013500, 1986."},{"key":"17_CR23","unstructured":"M. Winslett. Sometimes updates are circumscription. In Proc. of IJCAI-89, pages 859\u2013863, 1989."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"M. Winslett. Updating logical databases. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511663109"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"H.P. Yap","year":"1983","unstructured":"H.P. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287\u2013300, 1983.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T11:39:48Z","timestamp":1578483588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_17"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}