{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:18:32Z","timestamp":1773775112630,"version":"3.50.1"},"publisher-location":"Cham","reference-count":79,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030770907","type":"print"},{"value":"9783030770914","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77091-4_21","type":"book-chapter","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T16:03:21Z","timestamp":1621613001000},"page":"335-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["From Contrastive to Abductive Explanations and Back Again"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4535-2902","authenticated-orcid":false,"given":"Alexey","family":"Ignatiev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5181-4560","authenticated-orcid":false,"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7689-8246","authenticated-orcid":false,"given":"Nicholas","family":"Asher","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6632-3086","authenticated-orcid":false,"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"key":"21_CR1","volume-title":"The Nature of Explanation","author":"P Achinstein","year":"1980","unstructured":"Achinstein, P.: The Nature of Explanation. Oxford University Press, Oxford (1980)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (XAI). IEEE Access 6, 52138\u201352160 (2018)","journal-title":"IEEE Access"},{"key":"21_CR3","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-91473-2_1","volume-title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations","author":"JM Alonso","year":"2018","unstructured":"Alonso, J.M., Castiello, C., Mencar, C.: A bibliometric analysis of the explainable artificial intelligence research field. In: Medina, J., et al. (eds.) IPMU 2018. CCIS, vol. 853, pp. 3\u201315. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91473-2_1"},{"key":"21_CR4","unstructured":"Angwin, J., Larson, J., Mattu, S., Kirchner, L.: Machine bias (2016). http:\/\/tiny.cc\/dd7mjz"},{"key":"21_CR5","unstructured":"Anjomshoae, S., Najjar, A., Calvaresi, D., Fr\u00e4mling, K.: Explainable agents and robots: results from a systematic literature review. In: AAMAS, pp. 1078\u20131088 (2019)"},{"key":"21_CR6","unstructured":"Asher, N., Paul, S., Russell, C.: Adequate and fair explanations. CoRR, abs\/2001.07578 (2020)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-319-21668-3_5","volume-title":"Computer Aided Verification","author":"F Bacchus","year":"2015","unstructured":"Bacchus, F., Katsirelos, G.: Using minimal correction sets to more efficiently compute minimal unsatisfiable sets. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 70\u201386. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21668-3_5"},{"key":"21_CR8","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). https:\/\/doi.org\/10.1007\/978-3-540-30557-6_14"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-01090-4_9","volume-title":"Automated Technology for Verification and Analysis","author":"J Bend\u00edk","year":"2018","unstructured":"Bend\u00edk, J., \u010cern\u00e1, I., Bene\u0161, N.: Recursive online enumeration of all minimal unsatisfiable subsets. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 143\u2013159. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_9"},{"key":"21_CR10","unstructured":"Biran, O., Cotton, C.: Explanation and justification in machine learning: a survey. In: IJCAI-17 Workshop on Explainable AI (XAI), vol. 8, p. 1 (2017)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theoret. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theoret. Artif. Intell."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-18008-3_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Bonfietti","year":"2015","unstructured":"Bonfietti, A., Lombardi, M., Milano, M.: Embedding decision trees and random forests in constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 74\u201390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_6"},{"key":"21_CR13","first-page":"72","volume-title":"Analytical Philsophy","author":"S Bromberger","year":"1962","unstructured":"Bromberger, S.: An approach to explanation. In: Butler, R. (ed.) Analytical Philsophy, pp. 72\u2013105. Oxford University Press, Oxford (1962)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: KDD, pp. 785\u2013794. ACM (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Darwiche, A.: Three modern roles for logic in AI. In: PODS, pp. 229\u2013243 (2020)","DOI":"10.1145\/3375395.3389131"},{"key":"21_CR16","unstructured":"Darwiche, A., Hirth, A.: On the reasons behind decisions. In: ECAI, pp. 712\u2013720 (2020)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"21_CR18","unstructured":"Dhurandhar, A., et al.: Explanations based on the missing: towards contrastive explanations with pertinent negatives. In: NIPS, pp. 590\u2013601 (2018)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Dosilovic, F.K., Brcic, M., Hlupic, N.: Explainable artificial intelligence: a survey. In: MIPRO, pp. 210\u2013215 (2018)","DOI":"10.23919\/MIPRO.2018.8400040"},{"key":"21_CR20","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"21_CR21","unstructured":"Auditing black-box predictive models (2016). http:\/\/tiny.cc\/6e7mjz"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: KDD, pp. 259\u2013268. ACM (2015)","DOI":"10.1145\/2783258.2783311"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1017\/S0890060411000011","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. Artif. Intell. Eng. Des. Anal. Manuf. 26, 53\u201362 (2012)","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"21_CR24","unstructured":"Friedler, S., Scheidegger, C., Venkatasubramanian, S.: On algorithmic fairness, discrimination and disparate impact (2015)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Friedler, S.A., Scheidegger, C., Venkatasubramanian, S., Choudhary, S., Hamilton, E.P., Roth, D.: A comparative study of fairness-enhancing interventions in machine learning. In: FAT, pp. 329\u2013338. ACM (2019)","DOI":"10.1145\/3287560.3287589"},{"key":"21_CR26","unstructured":"Frosst, N., Hinton, G.E.: Distilling a neural network into a soft decision tree. In: CEx@AI*IA (2017)"},{"key":"21_CR27","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop (2015)"},{"key":"21_CR28","unstructured":"Google. AI Explainability Whitepaper (2019). http:\/\/tiny.cc\/tjz2hz"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Izza, Y., Lagniez, J.: Boosting MCSes enumeration. In: IJCAI, pp. 1309\u20131315 (2018)","DOI":"10.24963\/ijcai.2018\/182"},{"issue":"5","key":"21_CR30","doi-asserted-by":"publisher","first-page":"93:1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93:1\u201393:42 (2019)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"21_CR31","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MIS.2017.54","volume":"32","author":"RR Hoffman","year":"2017","unstructured":"Hoffman, R.R., Klein, G.: Explaining explanation, part 1: theoretical foundations. IEEE Intell. Syst. 32(3), 68\u201373 (2017)","journal-title":"IEEE Intell. Syst."},{"issue":"3","key":"21_CR32","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/MIS.2018.033001421","volume":"33","author":"RR Hoffman","year":"2018","unstructured":"Hoffman, R.R., Miller, T., Mueller, S.T., Klein, G., Clancey, W.J.: Explaining explanation, part 4: a deep dive on deep nets. IEEE Intell. Syst. 33(3), 87\u201395 (2018)","journal-title":"IEEE Intell. Syst."},{"issue":"4","key":"21_CR33","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MIS.2017.3121544","volume":"32","author":"RR Hoffman","year":"2017","unstructured":"Hoffman, R.R., Mueller, S.T., Klein, G.: Explaining explanation, part 2: empirical foundations. IEEE Intell. Syst. 32(4), 78\u201386 (2017)","journal-title":"IEEE Intell. Syst."},{"key":"21_CR34","unstructured":"Hoffman, R.R., Mueller, S.T., Klein, G., Litman, J.: Metrics for explainable AI: challenges and prospects. CoRR, abs\/1812.04608 (2018)"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Ignatiev, A.: Towards trustable explainable AI. In: IJCAI, pp. 5154\u20135158 (2020)","DOI":"10.24963\/ijcai.2020\/726"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT Oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"key":"21_CR37","first-page":"53","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an efficient MaxSAT solver. J. Satisf. Boolean Model. Comput. 11, 53\u201364 (2019)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: Abduction-based explanations for machine learning models. In: AAAI, pp. 1511\u20131519 (2019)","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"21_CR39","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On relating explanations and adversarial examples. In: NeurIPS, pp. 15857\u201315867 (2019)"},{"key":"21_CR40","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On validating, repairing and refining heuristic ML explanations. CoRR, abs\/1907.02509 (2019)"},{"key":"21_CR41","unstructured":"Izza, Y., Ignatiev, A., Marques-Silva, J.: On explaining decision trees. CoRR, abs\/2010.11034 (2020)"},{"key":"21_CR42","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2016.01.002","volume":"233","author":"M Janota","year":"2016","unstructured":"Janota, M., Marques-Silva, J.: On the query complexity of selecting minimal sets for monotone predicates. Artif. Intell. 233, 73\u201383 (2016)","journal-title":"Artif. Intell."},{"issue":"4","key":"21_CR43","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s10817-018-9499-8","volume":"63","author":"S Jha","year":"2019","unstructured":"Jha, S., Sahai, T., Raman, V., Pinto, A., Francis, M.: Explaining AI decisions using efficient methods for learning sparse Boolean formulae. J. Autom. Reasoning 63(4), 1055\u20131075 (2019)","journal-title":"J. Autom. Reasoning"},{"key":"21_CR44","unstructured":"Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167\u2013172 (2004)"},{"issue":"2","key":"21_CR45","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MIS.2018.022441353","volume":"33","author":"G Klein","year":"2018","unstructured":"Klein, G.: Explaining explanation, part 3: the causal landscape. IEEE Intell. Syst. 33(2), 83\u201388 (2018)","journal-title":"IEEE Intell. Syst."},{"key":"21_CR46","unstructured":"Kohavi, R.: Scaling up the accuracy of Naive-Bayes classifiers: a decision-tree hybrid. In: KDD, pp. 202\u2013207 (1996)"},{"key":"21_CR47","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-015-9183-0","volume-title":"Decision Procedures - An Algorithmic Point of View","author":"D Kroening","year":"2016","unstructured":"Kroening, D., Strichman, O.: Decision Procedures - An Algorithmic Point of View. Texts in Theoretical Computer Science. An EATCS Series, 2nd edn. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/s10601-015-9183-0","edition":"2"},{"issue":"2","key":"21_CR48","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., Silva, J.M.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2016). https:\/\/doi.org\/10.1007\/s10601-015-9183-0","journal-title":"Constraints"},{"issue":"1","key":"21_CR49","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10817-007-9084-z","journal-title":"J. Autom. Reasoning"},{"key":"21_CR50","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.artint.2016.01.005","volume":"244","author":"M Lombardi","year":"2017","unstructured":"Lombardi, M., Milano, M., Bartolini, A.: Empirical decision model learning. Artif. Intell. 244, 343\u2013367 (2017)","journal-title":"Artif. Intell."},{"key":"21_CR51","unstructured":"Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: NIPS, pp. 4765\u20134774 (2017)"},{"key":"21_CR52","unstructured":"Marques-Silva, J., Gerspacher, T., Cooper, M.C., Ignatiev, A., Narodytska, N.: Explaining Naive Bayes and other linear classifiers with polynomial time and delay. In: NeurIPS (2020)"},{"key":"21_CR53","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: IJCAI, pp. 615\u2013622 (2013)"},{"key":"21_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-39799-8_39","volume-title":"Computer Aided Verification","author":"J Marques-Silva","year":"2013","unstructured":"Marques-Silva, J., Janota, M., Belov, A.: Minimal sets over monotone predicates in Boolean formulae. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 592\u2013607. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_39"},{"key":"21_CR55","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.artint.2017.07.005","volume":"252","author":"J Marques-Silva","year":"2017","unstructured":"Marques-Silva, J., Janota, M., Menc\u00eda, C.: Minimal sets on propositional formulae. Problems and reductions. Artif. Intell. 252, 22\u201350 (2017)","journal-title":"Artif. Intell."},{"key":"21_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-40970-2_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"C Menc\u00eda","year":"2016","unstructured":"Menc\u00eda, C., Ignatiev, A., Previti, A., Marques-Silva, J.: MCS extraction with sublinear Oracle queries. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 342\u2013360. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_21"},{"key":"21_CR57","unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: IJCAI, pp. 1973\u20131979 (2015)"},{"key":"21_CR58","unstructured":"Miller, T.: Contrastive explanation: a structural-model approach. CoRR, abs\/1811.03163 (2018)"},{"issue":"3","key":"21_CR59","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/3313107","volume":"25","author":"T Miller","year":"2019","unstructured":"Miller, T.: \u201cbut why?\u201d Understanding Explainable artificial intelligence. ACM Crossroads 25(3), 20\u201325 (2019)","journal-title":"ACM Crossroads"},{"key":"21_CR60","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":"21_CR61","doi-asserted-by":"crossref","unstructured":"Mittelstadt, B.D., Russell, C., Wachter, S.: Explaining explanations in AI. In: FAT, pp. 279\u2013288 (2019)","DOI":"10.1145\/3287560.3287574"},{"key":"21_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dsp.2017.10.011","volume":"73","author":"G Montavon","year":"2018","unstructured":"Montavon, G., Samek, W., M\u00fcller, K.: Methods for interpreting and understanding deep neural networks. Digital Signal Process. 73, 1\u201315 (2018)","journal-title":"Digital Signal Process."},{"key":"21_CR63","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bj\u00f8rner, N., Marinescu, M.V., Sagiv, M.: Core-guided minimal correction set and core enumeration. In: IJCAI, pp. 1353\u20131361 (2018)","DOI":"10.24963\/ijcai.2018\/188"},{"key":"21_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-24258-9_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"N Narodytska","year":"2019","unstructured":"Narodytska, N., Shrotri, A., Meel, K.S., Ignatiev, A., Marques-Silva, J.: Assessing heuristic machine learning explanations with model counting. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 267\u2013278. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_19"},{"key":"21_CR65","unstructured":"Perron, L., Furnon, V.: Or-tools"},{"key":"21_CR66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794797","volume-title":"Artificial Intelligence - Foundations of Computational Agents","author":"D Poole","year":"2010","unstructured":"Poole, D., Mackworth, A.K.: Artificial Intelligence - Foundations of Computational Agents. Cambridge University Press, Cambridge (2010)"},{"key":"21_CR67","unstructured":"Radford, A., Metz, L., Chintala, S.: Unsupervised representation learning with deep convolutional generative adversarial networks. In: ICLR (2016)"},{"issue":"1","key":"21_CR68","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987)","journal-title":"Artif. Intell."},{"key":"21_CR69","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d: explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144 (2016)","DOI":"10.18653\/v1\/N16-3020"},{"key":"21_CR70","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Anchors: high-precision model-agnostic explanations. In: AAAI, pp. 1527\u20131535 (2018)","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"21_CR71","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-28954-6","volume-title":"Explainable AI: Interpreting, Explaining and Visualizing Deep Learning","year":"2019","unstructured":"Samek, W., Montavon, G., Vedaldi, A., Hansen, L.K., M\u00fcller, K.-R. (eds.): Explainable AI: Interpreting, Explaining and Visualizing Deep Learning. LNCS (LNAI), vol. 11700. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28954-6"},{"key":"21_CR72","doi-asserted-by":"crossref","unstructured":"Samek, W., M\u00fcller, K.: Towards explainable artificial intelligence. In: Samek, et al. [71], pp. 5\u201322","DOI":"10.1007\/978-3-030-28954-6_1"},{"key":"21_CR73","doi-asserted-by":"crossref","unstructured":"Schmidt, P., Witte, A.D.: Predicting recidivism in North Carolina, 1978 and 1980. Inter-University Consortium for Political and Social Research (1988)","DOI":"10.3886\/ICPSR08987"},{"key":"21_CR74","unstructured":"Shih, A., Choi, A., Darwiche, A.: Formal verification of Bayesian network classifiers. In: PGM, pp. 427\u2013438 (2018)"},{"key":"21_CR75","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: A symbolic approach to explaining Bayesian network classifiers. In: IJCAI, pp. 5103\u20135111 (2018)","DOI":"10.24963\/ijcai.2018\/708"},{"key":"21_CR76","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: Compiling Bayesian network classifiers into decision graphs. In: AAAI, pp. 7966\u20137974 (2019)","DOI":"10.1609\/aaai.v33i01.33017966"},{"issue":"2","key":"21_CR77","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TNNLS.2016.2603784","volume":"29","author":"SN Tran","year":"2018","unstructured":"Tran, S.N., d\u2019Avila Garcez, A.S.: Deep logic networks: inserting and extracting knowledge from deep belief networks. IEEE Trans. Neural Netw. Learn. Syst. 29(2), 246\u2013258 (2018)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"21_CR78","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.artint.2015.05.004","volume":"244","author":"S Verwer","year":"2017","unstructured":"Verwer, S., Zhang, Y., Ye, Q.C.: Auction optimization using regression trees and linear models as integer programs. Artif. Intell. 244, 368\u2013395 (2017)","journal-title":"Artif. Intell."},{"key":"21_CR79","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-030-32236-6_51","volume-title":"Natural Language Processing and Chinese Computing","author":"F Xu","year":"2019","unstructured":"Xu, F., Uszkoreit, H., Du, Y., Fan, W., Zhao, D., Zhu, J.: Explainable AI: a brief survey on history, research areas, approaches and challenges. In: Tang, J., Kan, M.-Y., Zhao, D., Li, S., Zan, H. (eds.) NLPCC 2019. LNCS (LNAI), vol. 11839, pp. 563\u2013574. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32236-6_51"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2020 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77091-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T06:43:32Z","timestamp":1672209812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77091-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770907","9783030770914"],"references-count":79,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77091-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2020.disco.unimib.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}