{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:11Z","timestamp":1748751071841,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662488980"},{"type":"electronic","value":"9783662488997"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_4","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T03:59:28Z","timestamp":1448078368000},"page":"48-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Anti-subsumptive Knowledge Enforcement"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Gr\u00e9goire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marie","family":"Lagniez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"volume-title":"Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project","year":"1984","key":"4_CR1","unstructured":"Buchanan, B.G., Shortliffe, E.H. (eds.): Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project. Addison-Wesley, Reading (1984)"},{"key":"4_CR2","volume-title":"The Mathematics of Inheritance Systems","author":"DS Touretzky","year":"1986","unstructured":"Touretzky, D.S.: The Mathematics of Inheritance Systems. Morgan Kaufmann, Los Altos (1986)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Sombe, L. (collective work): Reasoning Under Incomplete Information in Artificial Intelligence: A Comparison of Formalisms Using a Simple Example. Wiley, New York (1990)","DOI":"10.1002\/int.4550050404"},{"key":"4_CR4","volume-title":"Readings in Nonmonotonic Authors","author":"DL Ginsberg","year":"1988","unstructured":"Ginsberg, D.L.: Readings in Nonmonotonic Authors. Morgan Kaufmann, Los Altos (1988)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-25975-3_5","volume-title":"Knowledge Science, Engineering and Management","author":"P Besnard","year":"2011","unstructured":"Besnard, P., Gr\u00e9goire, \u00c9., Ramon, S.: Enforcing logically weaker knowledge in classical logic. In: Xiong, H., Lee, W.B. (eds.) KSEM 2011. LNCS, vol. 7091, pp. 44\u201355. Springer, Heidelberg (2011)"},{"issue":"2","key":"4_CR6","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 contraction and revision functions. J. Symbolic Logic 50(2), 510\u2013530 (1985)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10992-011-9171-9","volume":"40","author":"EL Ferm\u00e9","year":"2011","unstructured":"Ferm\u00e9, E.L., Hansson, S.O.: AGM 25 years - twenty-five years of research in belief change. J. Philos. Logic 40(2), 295\u2013331 (2011)","journal-title":"J. Philos. Logic"},{"key":"4_CR8","unstructured":"Besnard, P., Gr\u00e9goire, \u00c9., Ramon, S.: Preemption operators. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 893\u2013894 (2012)"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ijar.2012.11.003","volume":"54","author":"P Besnard","year":"2013","unstructured":"Besnard, P., Gr\u00e9goire, \u00c9., Ramon, S.: Overriding subsuming rules. Int. J. Approximate Reasoning 54(4), 452\u2013466 (2013)","journal-title":"Int. J. Approximate Reasoning"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-12096-6_2","volume-title":"Knowledge Science, Engineering and Management","author":"\u00c9 Gr\u00e9goire","year":"2014","unstructured":"Gr\u00e9goire, \u00c9.: Knowledge preemption and defeasible rules. In: Buchmann, R., Kifor, C.V., Yu, J. (eds.) KSEM 2014. LNCS, vol. 8793, pp. 13\u201324. Springer, Heidelberg (2014)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-540-76928-6_52","volume-title":"AI 2007: Advances in Artificial Intelligence","author":"ZQ Zhuang","year":"2007","unstructured":"Zhuang, Z.Q., Pagnucco, M., Meyer, T.: Implementing iterated belief change via prime implicates. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 507\u2013518. Springer, Heidelberg (2007)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bienvenu, M., Herzig, A., Qi, G.: Prime implicate-based belief revision operators. In: 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 741\u2013742 (2008)","DOI":"10.3233\/978-1-58603-891-5-741"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. (JAIR) 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-45220-1_18","volume-title":"Computer Science Logic","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Makino, K.: Generating all abductive explanations for queries on propositional horn theories. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 197\u2013211. Springer, Heidelberg (2003)"},{"key":"4_CR15","first-page":"31","volume":"21","author":"J Marques-Silva","year":"2014","unstructured":"Marques-Silva, J., Janota, M.: On the query complexity of selecting few minimal sets. Electron. Colloquium Comput. Complex. (ECCC) 21, 31 (2014)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J.M., Mazure, B.: An experimentally efficient method for (MSS, CoMSS) partitioning. In: Proceedings of the 28th Conference on Artificial Intelligence (AAAI 2014) (2014)","DOI":"10.1609\/aaai.v28i1.9118"},{"key":"4_CR17","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01066356","volume":"3","author":"A Fuhrmann","year":"1994","unstructured":"Fuhrmann, A., Hansson, S.O.: A survey of multiple contractions. J. Logic Lang. Inf. 3(1), 39\u201376 (1994)","journal-title":"J. Logic Lang. Inf."},{"key":"4_CR20","unstructured":"Ninth Max-SAT Evaluation (2014). http:\/\/www.maxsat.udl.cat\/14\/index.html"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M Liffiton","year":"2008","unstructured":"Liffiton, M., Sakallah, K.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-31612-8_22","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A Morgado","year":"2012","unstructured":"Morgado, A., Heras, F., Marques-Silva, J.: Improvements to core-guided binary search for MaxSAT. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 284\u2013297. Springer, Heidelberg (2012)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:28:13Z","timestamp":1748698093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}