{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:03:25Z","timestamp":1772780605640,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032087065","type":"print"},{"value":"9783032087072","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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-08707-2_15","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:32Z","timestamp":1761431612000},"page":"321-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Locally Pareto-Optimal Interpretations for\u00a0Black-Box Machine Learning Models"],"prefix":"10.1007","author":[{"given":"Aniruddha","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Supratik","family":"Chakraborty","sequence":"additional","affiliation":[]},{"given":"S.","family":"Akshay","sequence":"additional","affiliation":[]},{"given":"Shetal","family":"Shah","sequence":"additional","affiliation":[]},{"given":"Hazem","family":"Torfah","sequence":"additional","affiliation":[]},{"given":"Sanjit","family":"Seshia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"15_CR1","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). https:\/\/doi.org\/10.1109\/ACCESS.2018.2870052","journal-title":"IEEE Access"},{"key":"15_CR2","unstructured":"Biere, A., Faller, T., Fazekas, K., Fleury, M., Froleyks, N., Pollitt, F.: CaDiCaL, Gimsatul, IsaSAT and Kissat entering the SAT Competition 2024. In: Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proc.\u00a0of SAT Competition 2024 \u2013 Solver, Benchmark and Proof Checker Descriptions. Department of Computer Science Report Series B, vol. B-2024-1, pp. 8\u201310. University of Helsinki (2024)"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Bohanec, M.: Car Evaluation. UCI Machine Learning Repository (1988). https:\/\/doi.org\/10.24432\/C5JP48","DOI":"10.24432\/C5JP48"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., et al.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Charalampakos, F., Tsouparopoulos, T., Koutsopoulos, I.: Joint explainability-performance optimization with surrogate models for AI-driven edge services (2025). https:\/\/arxiv.org\/abs\/2503.07784","DOI":"10.1109\/ICMLCN64995.2025.11140577"},{"key":"15_CR6","unstructured":"Chen, W., Liu, L.: Pareto monte carlo tree search for multi-objective informative planning. CoRR abs\/2111.01825 (2021)"},{"key":"15_CR7","unstructured":"Craven, M.W., Shavlik, J.W.: Extracting tree-structured representations of trained networks. In: Touretzky, D.S., Mozer, M., Hasselmo, M.E. (eds.) Advances in Neural Information Processing Systems 8, NIPS, Denver, CO, USA, November 27-30, 1995, pp. 24\u201330. MIT Press (1995). http:\/\/papers.nips.cc\/paper\/1152-extracting-tree-structured-representations-of-trained-networks"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-53288-8_6","volume-title":"Computer Aided Verification","author":"DJ Fremont","year":"2020","unstructured":"Fremont, D.J., Chiu, J., Margineantu, D.D., Osipychev, D., Seshia, S.A.: Formal Analysis and Redesign of a Neural Network-Based Aircraft Taxiing System with VerifAI. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 122\u2013134. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_6"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML. ACM International Conference Proceeding Series, vol.\u00a0227, pp. 273\u2013280. ACM (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"15_CR10","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Pedreschi, D., Turini, F., Giannotti, F.: Local rule-based explanations of black box decision systems. CoRR abs\/1805.10820 (2018). http:\/\/arxiv.org\/abs\/1805.10820"},{"key":"15_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3236009","DOI":"10.1145\/3236009"},{"key":"15_CR12","volume-title":"Introduction to Automata Theory","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Addison-Wesley, Languages and Computation (1979)"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Johansson, U., K\u00f6nig, R., L\u00f6fstr\u00f6m, T., Bostr\u00f6m, H.: Evolved decision trees as conformal predictors. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, June 20-23, 2013, pp. 1794\u20131801. IEEE (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557778","DOI":"10.1109\/CEC.2013.6557778"},{"key":"15_CR14","unstructured":"Joshi, A., Chakraborty, S., Akshay, S., Shah, S., Torfah, H., Seshia, S.: Locally pareto-optimal interpretations for black-box machine learning models (2025). https:\/\/arxiv.org\/abs\/2508.15220"},{"issue":"12","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1999","DOI":"10.1016\/S0031-3203(98)00181-2","volume":"32","author":"R Krishnan","year":"1999","unstructured":"Krishnan, R., Sivakumar, G., Bhattacharya, P.: Extracting decision trees from trained neural networks. Patt. Recognit. 32(12), 1999\u20132009 (1999). https:\/\/doi.org\/10.1016\/S0031-3203(98)00181-2","journal-title":"Patt. Recognit."},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Krishnan, S., Wu, E.: PALM: machine learning explanations for iterative debugging. In: Binnig, C., Hellerstein, J.M., Parameswaran, A.G. (eds.) Proceedings of the 2nd Workshop on Human-In-the-Loop Data Analytics, HILDA@SIGMOD 2017, Chicago, IL, USA, May 14, 2017, pp. 4:1\u20134:6. ACM (2017). https:\/\/doi.org\/10.1145\/3077257.3077271","DOI":"10.1145\/3077257.3077271"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Luc, D.T.: Pareto Optimality, pp. 481\u2013515. Springer New York, New York, NY (2008)","DOI":"10.1007\/978-0-387-77247-9_18"},{"key":"15_CR18","unstructured":"Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: Guyon, I., et al., (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pp. 4765\u20134774 (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/8a20a8621978632d76c43dfd28b67767-Abstract.html"},{"key":"15_CR19","unstructured":"Kelly, M., Rachel\u00a0Longjohn, K.N.: The UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Nakai, K.: Yeast. UCI Machine Learning Repository (1991). https:\/\/doi.org\/10.24432\/C5KG68","DOI":"10.24432\/C5KG68"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cwhy should I trust you?\u201d: Explaining the predictions of any classifier. In: Proceedings of the Demonstrations Session, NAACL HLT 2016, The 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, San Diego California, USA, June 12-17, 2016, pp. 97\u2013101. The Association for Computational Linguistics (2016). https:\/\/doi.org\/10.18653\/V1\/N16-3020","DOI":"10.18653\/V1\/N16-3020"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Anchors: high-precision model-agnostic explanations. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pp. 1527\u20131535. AAAI Press (2018). https:\/\/doi.org\/10.1609\/AAAI.V32I1.11491","DOI":"10.1609\/AAAI.V32I1.11491"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning - From Theory to Algorithms. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781107298019"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Siegler, R.: Balance Scale. UCI Machine Learning Repository (1976). https:\/\/doi.org\/10.24432\/C5488X","DOI":"10.24432\/C5488X"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1007\/s10462-022-10228-y","volume":"56","author":"M Swiechowski","year":"2023","unstructured":"Swiechowski, M., Godlewski, K., Sawicki, B., Mandziuk, J.: Monte carlo tree search: a review of recent modifications and applications. Artif. Intell. Rev. 56(3), 2497\u20132562 (2023)","journal-title":"Artif. Intell. Rev."},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Torfah, H., Junges, S., Fremont, D.J., Seshia, S.A.: Formal analysis of AI-based autonomy: from modeling to runtime assurance. In: Feng, L., Fisman, D. (eds.) Runtime Verification - 21st International Conference, RV 2021, Virtual Event, October 11-14, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12974, pp. 311\u2013330. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-88494-9_19","DOI":"10.1007\/978-3-030-88494-9_19"},{"key":"15_CR27","unstructured":"Torfah, H., Shah, S., Chakraborty, S., Akshay, S., Seshia, S.A.: Synthesizing pareto-optimal interpretations for black-box models. In: FMCAD, pp. 153\u2013162. IEEE (2021)"},{"key":"15_CR28","unstructured":"Wang, W., Sebag, M.: Multi-objective monte-carlo tree search. In: ACML. JMLR Proceedings, vol.\u00a025, pp. 507\u2013522. JMLR.org (2012)"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Yu, J., Ignatiev, A., Stuckey, P.J., Bodic, P.L.: Computing optimal decision sets with SAT. In: Simonis, H. (ed.) Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12333, pp. 952\u2013970. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_55","DOI":"10.1007\/978-3-030-58475-7_55"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Zhang, R., Xin, R., Seltzer, M.I., Rudin, C.: Optimal sparse regression trees. In: Williams, B., Chen, Y., Neville, J. (eds.) Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 11270\u201311279. AAAI Press (2023). https:\/\/doi.org\/10.1609\/AAAI.V37I9.26334","DOI":"10.1609\/AAAI.V37I9.26334"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms - a comparative case study. In: PPSN. Lecture Notes in Computer Science, vol.\u00a01498, pp. 292\u2013304. Springer (1998)","DOI":"10.1007\/BFb0056872"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08707-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:36Z","timestamp":1761431616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","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":"atva2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/atva-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}