{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:08:40Z","timestamp":1780373320038,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032272416","type":"print"},{"value":"9783032272423","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27242-3_17","type":"book-chapter","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:29:05Z","timestamp":1780370945000},"page":"280-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cost-Minimal Parameter Correction Subsets for\u00a0Unsatisfiable Constraint Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7153-2502","authenticated-orcid":false,"given":"Antoine","family":"Laviolette","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5899-0217","authenticated-orcid":false,"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5602-7515","authenticated-orcid":false,"given":"Rapha\u00ebl","family":"Boudreault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"17_CR1","unstructured":"Bleukx, I., Devriendt, J., Gamba, E., Bogaerts, B., Guns, T.: Simplifying step-wise explanation sequences. In: Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), pp. 11:1\u201311:20 (2023)"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103550","volume":"300","author":"B Bogaerts","year":"2021","unstructured":"Bogaerts, B., Gamba, E., Guns, T.: A framework for step-wise explaining how to solve constraint satisfaction problems. Artif. Intell. 300, 103550 (2021)","journal-title":"Artif. Intell."},{"key":"17_CR3","unstructured":"Boudreault, R., Simard, V., Lafond, D., Quimper, C.G.: A constraint programming approach to ship refit project scheduling. In: Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), pp. 10:1\u201310:16 (2022)"},{"key":"17_CR4","unstructured":"Chu, G.G.: Improving Combinatorial Optimization. Ph.D. thesis. The University of Melbourne (2011)"},{"key":"17_CR5","unstructured":"Cloutier, S., Quimper, C.G.: Cumulative scheduling with calendars and overtime. In: Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming (CP 2024), pp. 7:1\u20137:16 (2024)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dev Gupta, S., Genc, B., O\u2019Sullivan, B.: Explanation in constraint satisfaction: a survey. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence, pp. 4400\u20134407 (2021)","DOI":"10.24963\/ijcai.2021\/601"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Gamba, E., Bogaerts, B., Guns, T.: Efficiently explaining CSPs with unsatisfiable subset optimization. In: 29th International Joint Conference on Artificial Intelligence, pp. 1381\u20131388. (2021)","DOI":"10.24963\/ijcai.2021\/191"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","volume":"297","author":"S Hartmann","year":"2022","unstructured":"Hartmann, S., Briskorn, D.: An updated survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 297(1), 1\u201314 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR9","unstructured":"Junker, U.: QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems. In: Proceedings of the 19th National Conference on Artifical Intelligence (AAAI), pp. 167\u2013172 (2004)"},{"key":"17_CR10","unstructured":"Jussien, N., Ouis, S.: User-friendly explanations for constraint programming. In: Proceedings of the 11th Workshop on Logic Programming Environments, WLPE 2001 (2001)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Korikov, A., Beck, J.C.: Objective-based counterfactual explanations for linear discrete optimization. In: Proceedings of the 20th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), pp. 18\u201334 (2023)","DOI":"10.1007\/978-3-031-33271-5_2"},{"key":"17_CR13","unstructured":"Lauffer, N., Topcu, U.: Human-understandable explanations of infeasibility for resource-constrained scheduling problems. In: ICAPS 2019 Workshop XAIP (April 2019)"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Leo, K., Tack, G.: Debugging unsatisfiable constraint models. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 77\u201393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_7","DOI":"10.1007\/978-3-319-59776-8_7"},{"key":"17_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_11","DOI":"10.1007\/978-3-642-38171-3_11"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"MH Liffiton","year":"2016","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2016)","journal-title":"Constraints"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Menc\u00eda, C.: Reasoning about inconsistent formulas. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 4899\u20134906 (2020)","DOI":"10.24963\/ijcai.2020\/682"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3233\/SAT190100","volume":"9","author":"A Nadel","year":"2014","unstructured":"Nadel, A., Ryvchin, V., Strichman, O.: Accelerated deletion-based extraction of minimal unsatisfiable cores. J. Satisfiabil. Boolean Model. Comput. 9, 27\u201351 (2014)","journal-title":"J. Satisfiabil. Boolean Model. Comput."},{"key":"17_CR19","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"17_CR20","unstructured":"Nightingale, P., Demirovi\u0107, E.: CSPLib problem 061: Resource-constrained project scheduling problem (RCPSP) (1999)"},{"key":"17_CR21","unstructured":"Perron, L., Furnon, V.: OR-Tools. Google (2024). https:\/\/developers.google.com\/optimization\/"},{"key":"17_CR22","unstructured":"Pov\u00e9da, G., et al.: Trustworthy and explainable decision-making for workforce allocation (2024). https:\/\/arxiv.org\/abs\/2412.10272"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Pritsker, A.A.B., Waiters, L.J., Wolfe, P.M.: Multiproject scheduling with limited resources: a zero-one programming approach. Manage. Sci. (1969)","DOI":"10.1287\/mnsc.16.1.93"},{"key":"17_CR24","unstructured":"Schaus, P.: CSPLib problem 051: Tank allocation (1999)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Schaus, P., R\u00e9gin, J.C., Van Schaeren, R., Dullaert, W., Raa, B.: Cardinality reasoning for bin-packing constraint: application to a tank allocation problem. In: Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP 2012), pp. 815\u2013822 (2012)","DOI":"10.1007\/978-3-642-33558-7_58"},{"issue":"4","key":"17_CR26","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10601-018-9289-2","volume":"23","author":"A Schiendorfer","year":"2018","unstructured":"Schiendorfer, A., Knapp, A., Anders, G., Reif, W.: MiniBrass: soft constraints for MiniZinc. Constraints 23(4), 403\u2013450 (2018)","journal-title":"Constraints"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Senthooran, I., et al.: Human-centred feasibility restoration. In: Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP2021), pp. 203\u2013243 (2021)","DOI":"10.1007\/s10601-023-09344-5"},{"issue":"2","key":"17_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10601-023-09344-5","volume":"28","author":"I Senthooran","year":"2023","unstructured":"Senthooran, I., et al.: Human-centred feasibility restoration in practice. Constraints 28(2), 203\u2013243 (2023)","journal-title":"Constraints"},{"issue":"4","key":"17_CR29","first-page":"45","volume":"7","author":"SF Smith","year":"1986","unstructured":"Smith, S.F., Fox, M.S., Ow, P.S.: Constructing and maintaining detailed production plans: investigations into the development of knowledge-based factory scheduling systems. AI Mag. 7(4), 45\u201361 (1986)","journal-title":"AI Mag."},{"issue":"2","key":"17_CR30","first-page":"55","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J.: The MiniZinc Challenge 2008\u20132013. AI Mag. 35(2), 55\u201360 (2014)","journal-title":"AI Mag."},{"issue":"3","key":"17_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(81)90177-6","volume":"8","author":"JNM van Loon","year":"1981","unstructured":"van Loon, J.N.M.: Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8(3), 283\u2013288 (1981)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"17_CR32","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the gdpr. Harvard J. Law Technol. 31(2), 841\u2013887 (2017)","journal-title":"Harvard J. Law Technol."},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Wang, L.: Cutting plane algorithms for the inverse mixed integer linear programming problem. Operat. Res. Lett. 37(2) (2009)","DOI":"10.1016\/j.orl.2008.12.001"},{"issue":"5","key":"17_CR34","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1016\/j.cor.2006.08.006","volume":"35","author":"J Yang","year":"2008","unstructured":"Yang, J.: Infeasibility resolution based on goal programming. Comput. Operat. Res. 35(5), 1483\u20131493 (2008)","journal-title":"Comput. Operat. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27242-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:29:17Z","timestamp":1780370957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27242-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032272416","9783032272423"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27242-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2026\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}