{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:10:46Z","timestamp":1742983846407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319572871"},{"type":"electronic","value":"9783319572888"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57288-8_7","type":"book-chapter","created":{"date-parts":[[2017,4,8]],"date-time":"2017-04-08T02:45:05Z","timestamp":1491619505000},"page":"99-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Learning Sparse Boolean Formulae for Explaining AI Decisions"],"prefix":"10.1007","author":[{"given":"Susmit","family":"Jha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasumathi","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuhin","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Francis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abouzied, A., Angluin, D., Papadimitriou, C., Hellerstein, J.M., Silberschatz, A.: Learning and verifying quantified boolean queries by example. In: ACM Symposium on Principles of Database Systems, pp. 49\u201360. ACM (2013)","DOI":"10.1145\/2463664.2465220"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Computational learning theory: survey and selected bibliography. In: ACM Symposium on Theory of Computing, pp. 351\u2013369. ACM (1992)","DOI":"10.1145\/129712.129746"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Kharitonov, M.: When won\u2019t membership queries help? In: ACM Symposium on Theory of Computing, pp. 444\u2013454. ACM (1991)","DOI":"10.1145\/103418.103420"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bittner, B., Bozzano, M., Cimatti, A., Gario, M., Griggio, A.: Towards pareto-optimal parameter synthesis for monotonie cost functions. In: FMCAD, pp. 23\u201330, October 2014","DOI":"10.1109\/FMCAD.2014.6987591"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BFb0035397","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Boigelot","year":"1997","unstructured":"Boigelot, B., Godefroid, P.: Automatic synthesis of specifications from the dynamic observation of reactive programs. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 321\u2013333. Springer, Heidelberg (1997). doi:\n                    10.1007\/BFb0035397"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Botin\u010dan, M., Babi\u0107, D., Sigma*: Symbolic learning of input-output specifications. In: POPL, pp. 443\u2013456 (2013)","DOI":"10.1145\/2480359.2429123"},{"issue":"1","key":"7_CR7","first-page":"93","volume":"43","author":"B Cook","year":"2013","unstructured":"Cook, B., Kroening, D., R\u00fcmmer, P., Wintersteiger, C.M.: Ranking function synthesis for bit-vector relations. FMSD 43(1), 93\u2013120 (2013)","journal-title":"FMSD"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.: A general lower bound on the number of examples needed for learning. Inf. Comput. 82(3), 247\u2013261 (1989)","journal-title":"Inf. Comput."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-05258-3_5","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"F Elizalde","year":"2009","unstructured":"Elizalde, F., Sucar, E., Noguez, J., Reyes, A.: Generating explanations based on Markov decision processes. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS (LNAI), vol. 5845, pp. 51\u201362. Springer, Heidelberg (2009). doi:\n                    10.1007\/978-3-642-05258-3_5"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Feng, C., Muggleton, S.: Towards inductive generalisation in higher order logic. In: 9th International Workshop on Machine learning, pp. 154\u2013162 D (2014)","DOI":"10.1016\/B978-1-55860-247-2.50025-5"},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/2345156.2254116","volume":"47","author":"P Godefroid","year":"2012","unstructured":"Godefroid, P., Taly, A.: Automated synthesis of symbolic instruction encodings from i\/o samples. SIGPLAN Not. 47(6), 441\u2013452 (2012)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2004.01.002","volume":"156","author":"J Goldsmith","year":"2004","unstructured":"Goldsmith, J., Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156(2), 139\u2013176 (2004)","journal-title":"Artif. Intell."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-54862-8_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Gurfinkel","year":"2014","unstructured":"Gurfinkel, A., Belov, A., Marques-Silva, J.: Synthesizing safe bit-precise invariants. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 93\u2013108. Springer, Heidelberg (2014). doi:\n                    10.1007\/978-3-642-54862-8_7"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.18564\/jasss.1437","volume":"13","author":"M Harbers","year":"2010","unstructured":"Harbers, M., Meyer, J.-J., van den Bosch, K.: Explaining simulations through self explaining agents. J. Artif. Soc. Soc. Simul. 13, 10 (2010)","journal-title":"J. Artif. Soc. Soc. Simul."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2007.05.018","volume":"384","author":"L Hellerstein","year":"2007","unstructured":"Hellerstein, L., Servedio, R.A.: On PAC learning algorithms for rich boolean function classes. Theoret. Comput. Sci. 384(1), 66\u201376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Jha, S., Seshia, S.A.: A theory of formal synthesis via inductive learning. Acta Informatica, pp. 1\u201334 (2017)","DOI":"10.1007\/s00236-017-0294-5"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Jha, S., A. Seshia, and A. Tiwari. Synthesis of optimal switching logic for hybrid systems. In: EMSOFT, pp. 107\u2013116. ACM (2011)","DOI":"10.1145\/2038642.2038660"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1145\/195613.195656","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Li, M., Valiant, L.: Learning boolean formulas. J. ACM 41(6), 1298\u20131328 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM (JACM) 41(1), 67\u201395 (1994)","journal-title":"Journal of the ACM (JACM)"},{"key":"7_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"7_CR21","unstructured":"Lecun, Y., Cortes, C.: The MNIST database of handwritten digits. \n                    http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"10","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1080\/00140139208967392","volume":"35","author":"J Lee","year":"1992","unstructured":"Lee, J., Moray, N.: Trust, control strategies and allocation of function in human-machine systems. Ergonomics 35(10), 1243\u20131270 (1992)","journal-title":"Ergonomics"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Mansour, Y.: Learning boolean functions via the fourier transform. In: Theoretical Advances in Neural Computation and Learning, pp. 391\u2013424 (1994)","DOI":"10.1007\/978-1-4615-2696-4_11"},{"key":"7_CR24","volume-title":"Automated Planning: Theory and Practice","author":"D Nau","year":"2004","unstructured":"Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM (JACM) 35(4), 965\u2013984 (1988)","journal-title":"J. ACM (JACM)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Raman, V.: Reactive switching protocols for multi-robot high-level tasks. In: IEEE\/RSJ, pp. 336\u2013341 (2014)","DOI":"10.1109\/IROS.2014.6942581"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Raman, V., Lignos, C., Finucane, C., Lee, K.C.T., Marcus, M.P., Kress-Gazit, H.: Sorry Dave, I\u2019m afraid i can\u2019t do that: explaining unachievable robot tasks using natural language. In: Robotics: Science and Systems (2013)","DOI":"10.15607\/RSS.2013.IX.023"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-21668-3_12","volume-title":"Computer Aided Verification","author":"A Reynolds","year":"2015","unstructured":"Reynolds, A., Deters, M., Kuncak, V., Tinelli, C., Barrett, C.: Counterexample-guided quantifier instantiation for synthesis in SMT. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 198\u2013216. Springer, Cham (2015). doi:\n                    10.1007\/978-3-319-21668-3_12"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Why Should I Trust You?: Explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144 (2016)","DOI":"10.18653\/v1\/N16-3020"},{"key":"7_CR30","volume-title":"OODA Loop","author":"J Russell","year":"2012","unstructured":"Russell, J., Cohn, R.: OODA Loop. Book on Demand, Norderstedt (2012)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S.: Automatic invariant generation for hybrid systems using ideal fixed points. In: HSCC, pp. 221\u2013230 (2010)","DOI":"10.1145\/1755952.1755984"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Miller, C., Raghunathan, R., Ravanbakhsh, H., Fainekos, G.: A model-based approach to synthesizing insulin infusion pump usage parameters for diabetic patients. In: Annual Allerton Conference on Communication, Control, and Computing, pp. 1610\u20131617, October 2012","DOI":"10.1109\/Allerton.2012.6483413"},{"issue":"1","key":"7_CR33","first-page":"25","volume":"32","author":"S Sankaranarayanan","year":"2008","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constructing invariants for hybrid systems. FMSD 32(1), 25\u201355 (2008)","journal-title":"FMSD"},{"issue":"3","key":"7_CR34","first-page":"647","volume":"41","author":"E \u0160trumbelj","year":"2014","unstructured":"\u0160trumbelj, E., Kononenko, I.: Explaining prediction models and individual predictions with feature contributions. KIS 41(3), 647\u2013665 (2014)","journal-title":"KIS"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-662-49674-9_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Urban","year":"2016","unstructured":"Urban, C., Gurfinkel, A., Kahsai, T.: Synthesizing ranking functions from bits and pieces. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 54\u201370. Springer, Heidelberg (2016). doi:\n                    10.1007\/978-3-662-49674-9_4"},{"key":"7_CR36","first-page":"309","volume":"42","author":"C Yuan","year":"2011","unstructured":"Yuan, C., Lim, H., Lu, T.-C.: Most relevant explanation in bayesian networks. J. Artif. Intell. Res. (JAIR) 42, 309\u2013352 (2011)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57288-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:02:39Z","timestamp":1558317759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57288-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319572871","9783319572888"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57288-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"9 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moffett Field","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ti.arc.nasa.gov\/events\/nfm-2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}