{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T17:21:42Z","timestamp":1775496102984,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319597751","type":"print"},{"value":"9783319597768","type":"electronic"}],"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-319-59776-8_7","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"77-93","source":"Crossref","is-referenced-by-count":8,"title":["Debugging Unsatisfiable Constraint Models"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Leo","sequence":"first","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Andraus, Z.S., Liffiton, M.H., Sakallah, K.A.: Refinement strategies for verification methods based on datapath abstraction. In: Asia and South Pacific Conference on Design Automation, January 2006","DOI":"10.1145\/1118299.1118306"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10589-012-9499-2","volume":"54","author":"M Ayala","year":"2013","unstructured":"Ayala, M., Benabid, A., Artigues, C., Hanen, C.: The resource-constrained modulo scheduling problem: an experimental study. Comput. Optim. Appl. 54(3), 645\u2013673 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-33954-2_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"F Bacchus","year":"2016","unstructured":"Bacchus, F., Katsirelos, G.: Finding a collection of MUSes incrementally. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 35\u201344. Springer, Cham (2016). doi: 10.1007\/978-3-319-33954-2_3"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30557-6_14"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_29"},{"key":"7_CR6","unstructured":"Frisch, A.M., Grum, M., Jefferson, C., Martnez, B., Miguel, H.I.: The design of ESSENCE: a constraint language for specifying combinatorial problems. In: IJCAI 2007, pp. 80\u201387 (2007)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-75271-4_17","volume-title":"Current Topics in Artificial Intelligence","author":"RM Gasca","year":"2007","unstructured":"Gasca, R.M., Valle, C., G\u00f3mez-L\u00f3pez, M.T., Ceballos, R.: NMUS: structural analysis for improving the derivation of all MUSes in overconstrained numeric CSPs. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds.) CAEPIA 2007. LNCS (LNAI), vol. 4788, pp. 160\u2013169. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75271-4_17"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"IP Gent","year":"1999","unstructured":"Gent, I.P., Walsh, T.: CSPlib: a benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480\u2013481. Springer, Heidelberg (1999). doi: 10.1007\/978-3-540-48085-3_36"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J Gleeson","year":"1990","unstructured":"Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. INFORMS J. Comput. 2(1), 61\u201363 (1990)","journal-title":"INFORMS J. Comput."},{"key":"7_CR10","unstructured":"Junker, U.: QuickXplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI01 Workshop on Modelling and Solving problems with constraints (2001)"},{"key":"7_CR11","unstructured":"Jussien, N., Ouis, S.: User-friendly explanations for constraint programming. In: Kusalik, A.J. (ed.) Proceedings of the Eleventh Workshop on Logic Programming Environments (WLPE 2001), Paphos, Cyprus, 1 December 2001 (2001)"},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10601-012-9116-0","volume":"17","author":"N Lazaar","year":"2012","unstructured":"Lazaar, N., Gotlieb, A., Lebbah, Y.: A CP framework for testing CP. Constraints 17(2), 123\u2013147 (2012)","journal-title":"Constraints"},{"key":"7_CR13","unstructured":"Leo, K., Tack, G.: Multi-pass high-level presolving. In: Yang, Q., Wooldridge, M. (eds.) Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 346\u2013352. AAAI Press (2015)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38171-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MH Liffiton","year":"2013","unstructured":"Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes quickly. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 160\u2013175. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38171-3_11"},{"issue":"2","key":"7_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"MH Liffiton","year":"2015","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2015)","journal-title":"Constraints"},{"issue":"1","key":"7_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"issue":"3","key":"7_CR17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(81)90177-6","volume":"8","author":"J Loon van","year":"1981","unstructured":"van Loon, J.: Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8(3), 283\u2013288 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_38"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11564751_34","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"B O\u2019Callaghan","year":"2005","unstructured":"O\u2019Callaghan, B., O\u2019Sullivan, B., Freuder, E.C.: Generating corrective explanations for interactive constraint satisfaction. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 445\u2013459. Springer, Heidelberg (2005). doi: 10.1007\/11564751_34"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544\u2013558. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_39"},{"key":"7_CR21","unstructured":"Ouis, S., Jussien, N., Boizumault, P.: k-relevant explanations for constraint programming. In: Russell, I., Haller, S.M. (eds.) Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 12\u201314 May 2003, St. Augustine, Florida, USA, pp. 192\u2013196. AAAI Press (2003)"},{"issue":"3","key":"7_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10601-010-9093-0","volume":"15","author":"P Stuckey","year":"2010","unstructured":"Stuckey, P., Becket, R., Fischer, J.: Philosophy of the MiniZinc challenge. Constraints 15(3), 307\u2013316 (2010)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:39:39Z","timestamp":1569382779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}