{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:00:05Z","timestamp":1743015605564,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030948757"},{"type":"electronic","value":"9783030948764"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-94876-4_3","type":"book-chapter","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T08:20:02Z","timestamp":1642494002000},"page":"45-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Temporally Uncertain Explainable AI Planning"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Murray","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Krarup","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Cashmore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bercher, P., et al.: Plan, repair, execute, explain-how planning helps to assemble your home theater. In: ICAPS (2014)","DOI":"10.1609\/icaps.v24i1.13664"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chakraborti, T., Sreedharan, S., Zhang, Y., Kambhampati, S.: Plan explanations as model reconciliation: moving beyond explanation as soliloquy. In: IJCAI (2017)","DOI":"10.24963\/ijcai.2017\/23"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chakraborti, T., Sreedharan, S., Kambhampati, S.: The emerging landscape of explainable AI planning and decision making. In: IJCAI, pp. 4803\u20134811 (2020)","DOI":"10.24963\/ijcai.2020\/669"},{"issue":"5","key":"3_CR4","first-page":"279","volume":"3","author":"K Chircop","year":"2013","unstructured":"Chircop, K., Zammit-Mangion, D.: On-constraint based methods for the generation of pareto frontiers. J. Mech. Eng. Autom. 3(5), 279\u2013289 (2013)","journal-title":"J. Mech. Eng. Autom."},{"issue":"1\u20133","key":"3_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1\u20133), 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"3_CR6","unstructured":"Edelkamp, S.: On the compilation of plan constraints and preferences. In: ICAPS, pp. 374\u2013377 (2006)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Eifler, R., Cashmore, M., Hoffmann, J., Magazzeni, D., Steinmetz, M.: A new approach to plan-space explanation: analyzing plan-property dependencies in oversubscription planning. In: AAAI, pp. 9818\u20139826 (2020)","DOI":"10.1609\/aaai.v34i06.6534"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Eriksson, S., Helmert, M.: Certified unsolvability for SAT planning with property directed reachability. In: ICAPS, vol. 30, pp. 90\u2013100 (2020)","DOI":"10.1609\/icaps.v30i1.6649"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson, S., R\u00f6ger, G., Helmert, M.: Unsolvability certificates for classical planning. In: AAAI (2017)","DOI":"10.1609\/icaps.v27i1.13818"},{"issue":"1","key":"3_CR10","first-page":"105","volume":"15","author":"CI F\u00e1bi\u00e1n","year":"2018","unstructured":"F\u00e1bi\u00e1n, C.I., et al.: Probability maximization by inner approximation. Acta Polytech. Hung. 15(1), 105\u2013125 (2018)","journal-title":"Acta Polytech. Hung."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Fang, C., Yu, P., Williams, B.C.: Chance-constrained probabilistic simple temporal problems. In: AAAI (2014)","DOI":"10.1609\/aaai.v28i1.9048"},{"key":"3_CR12","unstructured":"Fox, M., Long, D.: Extending the exploitation of symmetries in planning. In: ICAPS, pp. 83\u201391 (2002)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. JAIR 20, 61\u2013124 (2003)","journal-title":"JAIR"},{"key":"3_CR14","unstructured":"Fox, M., Long, D., Magazzeni, D.: Explainable planning. In: IJCAI-2017 Workshop on Explainable AI (2017)"},{"key":"3_CR15","unstructured":"Gerevini, A., Long, D.: Plan constraints and preferences in PDDL3. Technical report, Department of Electronics for Automation (2005)"},{"key":"3_CR16","volume-title":"Automated Planning: Theory and Practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Elsevier, Amsterdam (2004)"},{"key":"3_CR17","unstructured":"G\u00f6beldecker, M., Keller, T., Eyerich, P., Brenner, M., Nebel, B.: Coming up with good excuses: what to do when no plan can be found. In: Dagstuhl Seminar Proceedings (2010)"},{"key":"3_CR18","unstructured":"Helmert, M.: Decidability and undecidability results for planning with numerical state variables. In: AIPS, pp. 44\u201353 (2002)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Kasenberg, D., Roque, A., Thielstrom, R., Chita-Tegmark, M., Scheutz, M.: Generating justifications for norm-related agent decisions. arXiv preprint arXiv:1911.00226 (2019)","DOI":"10.18653\/v1\/W19-8660"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Kim, J., Muise, C., Shah, A., Agarwal, S., Shah, J.: Bayesian inference of linear temporal logic specifications for contrastive explanations. In: IJCAI, pp. 5591\u20135598 (2019)","DOI":"10.24963\/ijcai.2019\/776"},{"key":"3_CR21","unstructured":"Krarup, B., Krivic, S., Lindner, F., Long, D.: Towards contrastive explanations for comparing the ethics of plans. In: ICRA-2020 Workshop on Against Robot Dystopias (2020)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1613\/jair.1.12813","volume":"72","author":"B Krarup","year":"2021","unstructured":"Krarup, B., Krivic, S., Magazzeni, D., Long, D., Cashmore, M., Smith, D.E.: Contrastive explanations of plans through model restrictions. JAIR 72, 533\u2013612 (2021)","journal-title":"JAIR"},{"key":"3_CR23","unstructured":"Kulkarni, A., Zha, Y., Chakraborti, T., Vadlamudi, S.G., Zhang, Y., Kambhampati, S.: Explicablility as minimizing distance from expected behavior. arXiv preprint arXiv:1611.05497 (2016)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lund, K., Dietrich, S., Chow, S., Boerkoel, J.: Robust execution of probabilistic temporal plans. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.11019"},{"issue":"2","key":"3_CR25","first-page":"35","volume":"21","author":"D McDermott","year":"1998","unstructured":"McDermott, D.: The 1998 AI planning systems competition. AI Mag. 21(2), 35\u201355 (1998)","journal-title":"AI Mag."},{"key":"3_CR26","unstructured":"Mueller, S.T., Hoffman, R.R., Clancey, W.J., Emrey, A., Klein, G.: Explanation in human-AI systems: a literature meta-review, synopsis of key ideas and publications, and bibliography for explainable AI. CoRR abs\/1902.01876 (2019)"},{"key":"3_CR27","first-page":"301","volume":"32","author":"A Pr\u00e9kopa","year":"1971","unstructured":"Pr\u00e9kopa, A.: Logarithmic concave measures with applications to stochastic programming. Acta Scientiarum Mathematicarum 32, 301\u2013316 (1971)","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"3_CR28","first-page":"335","volume":"34","author":"A Pr\u00e9kopa","year":"1973","unstructured":"Pr\u00e9kopa, A.: On logarithmic concave measures and functions. Acta Scientiarum Mathematicarum 34, 335\u2013343 (1973)","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"3_CR29","first-page":"267","volume":"10","author":"A Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa, A.: Probabilistic programming. Handb. Oper. Res. Manag. Sci. 10, 267\u2013351 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"3_CR30","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"2013","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming, vol. 324. Springer, Dordrecht (2013)"},{"issue":"5","key":"3_CR31","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","volume":"1","author":"C Rudin","year":"2019","unstructured":"Rudin, C.: Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 1(5), 206\u2013215 (2019)","journal-title":"Nat. Mach. Intell."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Santana, P., Vaquero, T., Toledo, C., Wang, A., Fang, C., Williams, B.: PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty. In: ICAPS (2016)","DOI":"10.1609\/icaps.v26i1.13761"},{"key":"3_CR33","unstructured":"Smith, D.: Planning as an iterative process. In: AAAI (2012)"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Sreedharan, S., Chakraborti, T., Kambhampati, S.: Handling model uncertainty and multiplicity in explanations via model reconciliation. In: ICAPS (2018)","DOI":"10.1109\/HRI.2019.8673193"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Sreedharan, S., Srivastava, S., Smith, D., Kambhampati, S.: Why couldn\u2019t you do that? Explaining unsolvability of classical planning problems in the presence of plan advice. arXiv preprint arXiv:1903.08218 (2019)","DOI":"10.24963\/ijcai.2019\/197"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-46014-4_10","volume-title":"Methods and Applications of Artificial Intelligence","author":"I Tsamardinos","year":"2002","unstructured":"Tsamardinos, I.: A probabilistic approach to robust execution of temporal plans with uncertainty. In: Vlahavas, I.P., Spyropoulos, C.D. (eds.) SETN 2002. LNCS (LNAI), vol. 2308, pp. 97\u2013108. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46014-4_10"},{"issue":"4","key":"3_CR37","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s11228-020-00552-2","volume":"28","author":"W Van Ackooij","year":"2020","unstructured":"Van Ackooij, W.: A discussion of probability functions and constraints from a variational perspective. Set-Valued Var. Anal. 28(4), 585\u2013609 (2020). https:\/\/doi.org\/10.1007\/s11228-020-00552-2","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"3_CR38","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0020-7373(78)80049-2","volume":"10","author":"W Van Melle","year":"1978","unstructured":"Van Melle, W.: MYCIN: a knowledge-based consultation program for infectious disease diagnosis. Int. J. Man Mach. Stud. 10(3), 313\u2013322 (1978)","journal-title":"Int. J. Man Mach. Stud."},{"key":"3_CR39","unstructured":"Vidal, T., Ghallab, M.: Dealing with uncertain durations in temporal constraint networks dedicated to planning. In: ECAI (1996)"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/095281399146607","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. JAIR 11, 23\u201345 (1999). https:\/\/doi.org\/10.1080\/095281399146607","journal-title":"JAIR"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Yu, P., Fang, C., Williams, B.: Resolving over-constrained probabilistic temporal problems through chance constraint relaxation. In: Proceedings of the AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9652"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94876-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T10:23:39Z","timestamp":1674469419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94876-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030948757","9783030948764"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94876-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"50","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":"11","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":"4","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":"22% - 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.2","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":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Additionally, 4 invited papers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}