{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:01Z","timestamp":1742914261984,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662556641"},{"type":"electronic","value":"9783662556658"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55665-8_33","type":"book-chapter","created":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T15:01:02Z","timestamp":1503500462000},"page":"480-496","source":"Crossref","is-referenced-by-count":1,"title":["Boosting Distance-Based Revision Using SAT Encodings"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Konieczny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marie","family":"Lagniez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Marquis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,24]]},"reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"CE Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C.E., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Logic 50(2), 510\u2013530 (1985)","journal-title":"J. Symb. Logic"},{"issue":"1","key":"33_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0004-3702(99)00074-0","volume":"115","author":"M Cadoli","year":"1999","unstructured":"Cadoli, M., Donini, F., Liberatore, P., Schaerf, M.: The size of a revised knowledge base. Artif. Intell. 115(1), 25\u201364 (1999)","journal-title":"Artif. Intell."},{"key":"33_CR3","unstructured":"Dalal, M.: Investigations into a theory of knowledge base revision. In: Proceedings of the Seventh AAAI Conference on Artificial Intelligence (AAAI 1988), pp. 475\u2013479 (1988)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-39071-5_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"J Davies","year":"2013","unstructured":"Davies, J., Bacchus, F.: Exploiting the power of mip solvers in maxsat. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 166\u2013181. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39071-5_13"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-40627-0_21","volume-title":"Principles and Practice of Constraint Programming","author":"J Davies","year":"2013","unstructured":"Davies, J., Bacchus, F.: Postponing optimization to speed up MAXSAT solving. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 247\u2013262. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40627-0_21"},{"issue":"3","key":"33_CR6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.jal.2006.03.005","volume":"5","author":"JP Delgrande","year":"2007","unstructured":"Delgrande, J.P., Schaub, T.: A consistency-based framework for merging knowledge bases. J. Appl. Logic 5(3), 459\u2013477 (2007)","journal-title":"J. Appl. Logic"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-75256-1_10","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"JP Delgrande","year":"2007","unstructured":"Delgrande, J.P., Liu, D.H., Schaub, T., Thiele, S.: COBA 2.0: a consistency-based belief change system. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 78\u201390. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75256-1_10"},{"issue":"2\u20133","key":"33_CR8","doi-asserted-by":"crossref","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. Artif. Intell. 57(2\u20133), 227\u2013270 (1992)","journal-title":"Artif. Intell."},{"issue":"3","key":"33_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","volume":"52","author":"H Katsuno","year":"1991","unstructured":"Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263\u2013294 (1991)","journal-title":"Artif. Intell."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Konieczny, S., Lagniez, J.M., Marquis, P.: SAT encodings for distance-based belief merging operators. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1163\u20131169 (2017)","DOI":"10.1609\/aaai.v31i1.10681"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-44652-4_6","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C Lafage","year":"2001","unstructured":"Lafage, C., Lang, J.: Propositional distances and preference representation. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 48\u201359. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44652-4_6"},{"key":"33_CR12","unstructured":"Liberatore, P.: Compilation of intractable problems and its application to artificial intelligence. Ph.D. thesis, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (1998)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-34459-6_2","volume-title":"Advances in Artificial Intelligence - SBIA 2012","author":"RU Lundberg","year":"2012","unstructured":"Lundberg, R.U., Ribeiro, M.M., Wassermann, R.: A Framework for empirical evaluation of belief change operators. In: Barros, L.N., Finger, M., Pozo, A.T., Gimen\u00e9nez-Lugo, G.A., Castilho, M. (eds.) SBIA 2012. LNCS, pp. 12\u201321. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34459-6_2"},{"key":"33_CR14","series-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-94-011-5054-5_3","volume-title":"Belief Change","author":"B Nebel","year":"1998","unstructured":"Nebel, B.: How hard is it to revise a belief base? In: Dubois, D., Prade, H. (eds.) Belief Change. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 3, pp. 77\u2013145. Kluwer Academic, Netherlands (1998)"},{"issue":"3","key":"33_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293\u2013304 (1986)","journal-title":"J. Symb. Comput."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. Technical report, Symbolic Computation Group, University of T\u00fcbingen (2005)","DOI":"10.1007\/11564751_73"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: Structures in constructive mathematics and mathematical logic. In: On the Complexity of Derivation in Propositional Calculus, pp. 115\u2013125. Steklov Mathematical Institute (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"33_CR18","unstructured":"Williams, M.A., Sims, A.: Saten: an object-oriented web-based revision and extraction engine. CoRR cs.AI\/0003059 (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic, Rationality, and Interaction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55665-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T17:36:49Z","timestamp":1659375409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55665-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662556641","9783662556658"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55665-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}