{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:23:53Z","timestamp":1767651833711},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_22","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T04:23:01Z","timestamp":1251692581000},"page":"250-263","source":"Crossref","is-referenced-by-count":5,"title":["Belief Revision with Bounded Treewidth"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Pichler","sequence":"first","affiliation":[]},{"given":"Stefan","family":"R\u00fcmmele","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C. Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic\u00a050, 510\u2013530 (1985)","journal-title":"Journal of Symbolic Logic"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","volume":"52","author":"H. Katsuno","year":"1991","unstructured":"Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence\u00a052, 263\u2013294 (1991)","journal-title":"Artificial Intelligence"},{"key":"22_CR3","unstructured":"Dalal, M.: Investigations into a theory of knowledge base revision. In: Proc. AAAI 1988, pp. 449\u2013479. AAAI Press \/ The MIT Press (1988)"},{"key":"22_CR4","unstructured":"Satoh, K.: Nonmonotonic reasoning by minimal belief revision. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 455\u2013462 (1988)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","volume":"57","author":"T. Eiter","year":"1992","unstructured":"Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence\u00a057, 227\u2013270 (1992)","journal-title":"Artificial Intelligence"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 193\u2013242. Elsevier Science Publishers, Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"22_CR7","first-page":"250","volume-title":"Proc. AAAI 2006","author":"G. Gottlob","year":"2006","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. In: Proc. AAAI 2006, pp. 250\u2013256. AAAI Press, Menlo Park (2006)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"22_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-75560-9_35","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Samer","year":"2007","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 484\u2013498. Springer, Heidelberg (2007)"},{"key":"22_CR11","series-title":"Computations and Approximations","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. Computations and Approximations. Springer, Heidelberg (1994)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics\u00a011, 11\u201334 (2001)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. To appear in Proc. IJCAI (2009)","DOI":"10.1007\/978-3-642-04238-6_22"},{"key":"22_CR15","unstructured":"Winslett, M.: Reasoning about action using a possible models approach. In: Proc. (AAAI 1988), pp. 89\u201393. AAAI Press \/ The MIT Press (1988)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Forbus, K.: Introducing actions into qualitative simulation. In: Proc. IJCAI, pp. 1273\u20131278 (1989)","DOI":"10.21236\/ADA466199"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-540-85238-4_49","volume-title":"Mathematical Foundations of Computer Science 2008","author":"S. Szeider","year":"2008","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 601\u2013612. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04238-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:36:42Z","timestamp":1558499802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}