{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:39:10Z","timestamp":1760056750587,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032013989","type":"print"},{"value":"9783032013996","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"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-01399-6_2","type":"book-chapter","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:51:05Z","timestamp":1760014265000},"page":"21-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Constraint Reasoning to\u00a0Build Graphical Explanations for\u00a0Mixed-Integer Linear Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4981-8260","authenticated-orcid":false,"given":"Roger X.","family":"Lera-Leri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1658-6125","authenticated-orcid":false,"given":"Filippo","family":"Bistaffa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-5372","authenticated-orcid":false,"given":"Athina","family":"Georgara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2940-6886","authenticated-orcid":false,"given":"Juan A.","family":"Rodr\u00edguez-Aguilar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (XAI). IEEE Access 6, 52138\u201352160 (2018)","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"104799","DOI":"10.1016\/j.knosys.2019.06.007","volume":"182","author":"E Andrejczuk","year":"2019","unstructured":"Andrejczuk, E., Bistaffa, F., Blum, C., Rodr\u00edguez-Aguilar, J.A., Sierra, C.: Synergistic team composition: a computational approach to foster diversity in teams. Knowl. Based Syst. 182, 104799 (2019)","journal-title":"Knowl. Based Syst."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Arrieta, A.B., et al.: Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fus. 58, 82\u2013115 (2020)","DOI":"10.1016\/j.inffus.2019.12.012"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1109\/TITS.2019.2954982","volume":"22","author":"F Bistaffa","year":"2019","unstructured":"Bistaffa, F., Blum, C., Cerquides, J., Farinelli, A., Rodr\u00edguez-Aguilar, J.A.: A computational approach to quantify the benefits of ridesharing for policy makers and travellers. IEEE Trans. Intell. Transp. Syst. 22(1), 119\u2013130 (2019)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bogaerts, B., Gamba, E., Guns, T.: A framework for step-wise explaining how to solve constraint satisfaction problems. Artif. Intell. 300, 103550 (2021)","DOI":"10.1016\/j.artint.2021.103550"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0377-2217(94)90152-X","volume":"73","author":"N Chakravarti","year":"1994","unstructured":"Chakravarti, N.: Some results concerning post-infeasibility analysis. Eur. J. Oper. Res. 73(1), 139\u2013143 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01302895","volume":"4","author":"JW Chinneck","year":"1995","unstructured":"Chinneck, J.W.: Analyzing infeasible nonlinear programs. Comput. Optim. Appl. 4, 167\u2013179 (1995)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.9.2.164","volume":"9","author":"JW Chinneck","year":"1997","unstructured":"Chinneck, J.W.: Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9(2), 164\u2013174 (1997)","journal-title":"INFORMS J. Comput."},{"key":"2_CR10","unstructured":"Chinneck, J.W.: Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods, vol.\u00a0118. Springer, Heidelberg (2007)"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"JW Chinneck","year":"1991","unstructured":"Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3(2), 157\u2013168 (1991)","journal-title":"ORSA J. Comput."},{"key":"2_CR12","unstructured":"European Commission: ethics guidelines for trustworthy AI (2019). https:\/\/digital-strategy.ec.europa.eu\/en\/library\/ethics-guidelines-trustworthy-ai"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S De Vries","year":"2003","unstructured":"De Vries, S., Vohra, R.V.: Combinatorial auctions: a survey. INFORMS J. Comput. 15(3), 284\u2013309 (2003)","journal-title":"INFORMS J. Comput."},{"key":"2_CR14","unstructured":"Dechter, R.: Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms. Springer, Cham (2022)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Fenoy, A., Bistaffa, F., Farinelli, A.: An attention model for the formation of collectives in real-world domains. Artif. Intell. 328, 104064 (2024)","DOI":"10.1016\/j.artint.2023.104064"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Gamba, E., Bogaerts, B., Guns, T.: Efficiently explaining CSPs with unsatisfiable subset optimization. J. Artif. Intell. Res. 78, 709\u2013746 (2023)","DOI":"10.1613\/jair.1.14260"},{"key":"2_CR17","unstructured":"Georgara, A., Rodriguez\u00a0Aguilar, J.A., Sierra, C.: Building contrastive explanations for multi-agent team formation. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pp. 516\u2013524 (2022)"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","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. ORSA J. Comput. 2(1), 61\u201363 (1990)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/ijoc.11.1.63","volume":"11","author":"O Guieu","year":"1999","unstructured":"Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11(1), 63\u201377 (1999)","journal-title":"INFORMS J. Comput."},{"key":"2_CR20","doi-asserted-by":"crossref","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) (2022)","DOI":"10.1016\/j.ejor.2021.05.004"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Previti, A., Liffiton, M., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: International Conference on Principles and Practice of Constraint Programming, pp. 173\u2013182. Springer (2015)","DOI":"10.1007\/978-3-319-23219-5_13"},{"key":"2_CR22","unstructured":"Junker, U.: QuickXplain: preferred explanations and relaxations for over-constrained problems. In: Proceedings of the 19th National Conference on Artifical Intelligence, pp. 167\u2013172 (2004)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library: OR software - ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Korikov, A., Shleyfman, A., Beck, C.: Counterfactual explanations for optimization-based decisions in the context of the GDPR. In: ICAPS 2021 Workshop on Explainable AI Planning, pp. 4097\u20134103 (2021)","DOI":"10.24963\/ijcai.2021\/564"},{"key":"2_CR25","unstructured":"Lakkaraju, H., Slack, D., Chen, Y., Tan, C., Singh, S.: Rethinking explainability as a dialogue: a practitioner\u2019s perspective. arXiv preprint arXiv:2202.01875 (2022)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Lera-Leri, R.X., Bistaffa, F., Trescak, T., Rodr\u00edguez-Aguilar, J.A.: Computing job-tailored degree plans towards the acquisition of professional skills. Ann. Oper. Res., 1\u201334 (2025)","DOI":"10.1007\/s10479-025-06678-6"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Lera-Leri, R.X., et al.: Aggregating value systems for decision support. Knowl. Based Syst. 287, 111453 (2024)","DOI":"10.1016\/j.knosys.2024.111453"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Lera-Leri, R.X., Bistaffa, F.: A robust and scalable approach to meet user preferences in research project planning. In: ECAI 2024, pp. 4516\u20134523. IOS Press (2024)","DOI":"10.3233\/FAIA241043"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: the case of combinatorial auctions. In: Principles and Practice of Constraint Programming-CP 2002: 8th International Conference, CP 2002 Ithaca, NY, USA, 9\u201313 September 2002 Proceedings 8, pp. 556\u2013572. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-46135-3_37"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM Conference on Electronic commerce, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10601-008-9058-8","volume":"14","author":"M Liffiton","year":"2009","unstructured":"Liffiton, M., Mneimneh, M., Lynce, I., Andraus, Z., Marques-Silva, J., Sakallah, K.: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints 14, 415\u2013442 (2009)","journal-title":"Constraints"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Liffiton, M.H., Sakallah, K.A.: On finding all minimally unsatisfiable subformulas. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 173\u2013186. Springer (2005)","DOI":"10.1007\/11499107_13"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Foundations of Artificial Intelligence, vol.\u00a02, pp. 281\u2013328. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80013-1"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.07.007","volume":"267","author":"T Miller","year":"2019","unstructured":"Miller, T.: Explanation in artificial intelligence: insights from the social sciences. Artif. Intell. 267, 1\u201338 (2019)","journal-title":"Artif. Intell."},{"key":"2_CR35","unstructured":"Nardi, O., Boixel, A., Endriss, U.: A graph-based algorithm for the automated justification of collective decisions. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pp. 935\u2013943 (2022)"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Parker, M., Ryan, J.: Finding the minimum weight IIS cover of an infeasible system of linear inequalities. Ann. Math. Artif. Intell. 17(1), 107\u2013126 (1996)","DOI":"10.1007\/BF02284626"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Pozanco, A., Mosca, F., Zehtabi, P., Magazzeni, D., Kraus, S.: Explaining preference-driven schedules: the EXPRES framework. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a032, pp. 710\u2013718 (2022)","DOI":"10.1609\/icaps.v32i1.19861"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Rai, A.: Explainable AI: from black box to glass box. J. Acad. Mark. Sci. 48(1), 137\u2013141 (2020)","DOI":"10.1007\/s11747-019-00710-5"},{"key":"2_CR39","unstructured":"Rosenfeld, A.: Better metrics for evaluating explainable artificial intelligence. In: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, pp. 45\u201350 (2021)"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Samek, W., M\u00fcller, K.R.: Towards explainable artificial intelligence. In: Explainable AI: Interpreting, Explaining and Visualizing Deep Learning, pp. 5\u201322. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-28954-6_1"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Silva, J.P.M.: Minimal unsatisfiability: models, algorithms and applications (invited paper). In: ISMVL, vol.\u00a010, pp. 9\u201314 (2010)","DOI":"10.1109\/ISMVL.2010.11"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Tamiz, M., Mardle, S.J., Jones, D.F.: Detecting IIS in infeasible linear programmes using techniques from goal programming. Comput. Oper. Res. 23(2), 113\u2013119 (1996)","DOI":"10.1016\/0305-0548(95)00018-H"},{"issue":"3","key":"2_CR43","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(81)90177-6","volume":"8","author":"J Van Loon","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":"2_CR44","doi-asserted-by":"crossref","unstructured":"Wolsey, L.A.: Integer Programming. Wiley (2020)","DOI":"10.1002\/9781119606475"},{"key":"2_CR45","unstructured":"Ze\u010devi\u0107, M., Dhami, D.S., Rothkopf, C.A., Kersting, K.: Causal explanations of structural causal models. arXiv preprint arXiv:2110.02395 (2021)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Zehtabi, P., Pozanco, A., Bolch, A., Borrajo, D., Kraus, S.: Contrastive explanations of centralized multi-agent optimization solutions. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a034, pp. 671\u2013679 (2024)","DOI":"10.1609\/icaps.v34i1.31530"}],"container-title":["Lecture Notes in Computer Science","Explainable, Trustworthy, and Responsible AI and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01399-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:07:00Z","timestamp":1760015220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01399-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"ISBN":["9783032013989","9783032013996"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01399-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"10 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EXTRAAMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Explainable, Trustworthy, and Responsible AI and Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Detroit, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"extraamas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/extraamas.ehealth.hevs.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}