{"type":"ScholarlyArticle","title":"Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties","authors":[{"name":"Rebecca Eifler","slug":"rebecca-eifler","given":"Rebecca","family":"Eifler","affiliation":"Saarland University , Saarland Informatics Campus , Germany"},{"name":"Marcel Steinmetz","slug":"marcel-steinmetz","given":"Marcel","family":"Steinmetz","affiliation":"Saarland University , Saarland Informatics Campus , Germany"},{"name":"Álvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":"Saarland University , Saarland Informatics Campus , Germany"},{"name":"Jörg Hoffmann","slug":"jorg-hoffmann","given":"Jörg","family":"Hoffmann","affiliation":"Saarland University , Saarland Informatics Campus , Germany"}],"abstract":"Justifying a plan to a user requires answering questions about the space of possible plans. Recent work introduced a framework for doing so via plan-property dependencies, where plan properties p are Boolean functions on plans, and p entails q if all plans that satisfy p also satisfy q. We extend this work in two ways. First, we introduce new algorithms for computing plan-property dependencies, leveraging symbolic search and devising pruning methods for this purpose. Second, while the properties p were previously limited to goal facts and so-called action-set (AS) properties, here we extend them to LTL. Our new algorithms vastly outperform the previous ones, and our methods for LTL cause little overhead on AS properties.","doi":"10.24963/ijcai.2020/566","url":"https://ijcai.org/proceedings/2020/566","pdf":"https://ijcai.org/proceedings/2020/0566.pdf","markdown":"https://ijcai.org/proceedings/2020/566.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/566","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Planning and Scheduling","track":"Main track","number":566,"pages":{"first":4091,"last":4097},"keywords":["Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25133/file_25133.m3u8","length_sec":291,"provider":"hls"}],"references":[{"position":1,"raw":"[Baier and McIlraith, 2006] Jorge A. Baier and Sheila A. McIlraith. Planning with first-order temporally extended goals using heuris- tic search. In Proc. AAAI, pages 788-795, 2006.","title":"Planning with first-order temporally extended goals using heuristic search","authors":"Jorge A Baier, Sheila A Mcilraith","year":"2006","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baier et al., 2009] Jorge A. Baier, Fahiem Bacchus, and Sheila A. McIlraith. A heuristic search approach to planning with tempo- rally extended preferences. AI, 173(5-6):593-618, 2009.","title":"A heuristic search approach to planning with temporally extended preferences","authors":"Jorge A Baier, Fahiem Bacchus, Sheila A Mcilraith","year":"2009","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cashmore et al., 2019] Michael Cashmore, Anna Collins, Ben- jamin Krarup, Senka Krivic, Daniele Magazzeni, and David Smith. Towards explainable AI planning as a service. In ICAPS XAIP, 2019.","title":"Towards explainable AI planning as a service","authors":"Michael Cashmore, Anna Collins, Benjamin Krarup, Senka Krivic, Daniele Magazzeni, David Smith","year":"2019","venue":"ICAPS XAIP","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chinneck, 2007] John W. Chinneck. Feasibility and Infeasibil- ity in Optimization: Algorithms and Computational Methods. Springer-Verlag, 2007.","title":"Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods","authors":"John W Chinneck","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[De Giacomo et al., 2014] Giuseppe De Giacomo, Riccardo De Masellis, and Marco Montali. Reasoning on LTL on finite traces: Insensitivity to infiniteness. In AAAI, pages 1027-1033, 2014.","title":"Reasoning on LTL on finite traces: Insensitivity to infiniteness","authors":"Giuseppe De, Giacomo, Riccardo De Masellis, Marco Montali","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Domshlak and Mirkis, 2015] Carmel Domshlak and Vitaly Mirkis. Deterministic oversubscription planning as heuristic search: Ab- stractions and reformulations. JAIR, 52:97-169, 2015.","title":"Carmel Domshlak and Vitaly Mirkis. Deterministic oversubscription planning as heuristic search: Abstractions and reformulations","authors":"Mirkis Domshlak","year":"2015","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Edelkamp and Kissmann, 2009] Stefan Edelkamp and Peter Kiss- mann. Optimal symbolic planning with action costs and prefer- ences. In Proc. IJCAI, pages 1690-1695, 2009.","title":"Optimal symbolic planning with action costs and preferences","authors":"Stefan Edelkamp, Peter Kissmann","year":"2009","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/282"},{"position":8,"raw":"[Edelkamp, 2006] Stefan Edelkamp. On the compilation of plan constraints and preferences. In ICAPS, pages 374-377, 2006.","title":"On the compilation of plan constraints and preferences","authors":"Stefan Edelkamp","year":"2006","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eifler et al., 2020] Rebecca Eifler, Michael Cashmore, Jörg Hoff- mann, Daniele Magazzeni, and Marcel Steinmetz. A new ap- proach to plan-space explanation: Analyzing plan-property de- pendencies in oversubscription planning. In AAAI, 2020.","title":"A new approach to plan-space explanation: Analyzing plan-property dependencies in oversubscription planning","authors":"Rebecca Eifler, Michael Cashmore, Jörg Hoffmann, Daniele Magazzeni, Marcel Steinmetz","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fox and Long, 1998] Maria Fox and Derek Long. The automatic inference of state invariants in TIM. JAIR, 9:367-421, 1998.","title":"The automatic inference of state invariants in TIM","authors":"Maria Fox, Derek Long","year":"1998","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fox et al., 2017] Maria Fox, Derek Long, and Daniele Magazzeni. Explainable planning. In ICAI XAI, 2017.","title":"Explainable planning","authors":"Maria Fox, Derek Long, Daniele Magazzeni","year":"2017","venue":"ICAI XAI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gerevini et al., 2009] Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, and Yannis Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. AI, 173(5-6):619- 668, 2009.","title":"Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners","authors":"Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos","year":"2009","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Göbelbecker et al., 2010] Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, and Bernhard Nebel. Coming up with good excuses: What to do when no plan can be found. In Proc. ICAPS, pages 81-88, 2010.","title":"Coming up with good excuses: What to do when no plan can be found","authors":"Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel","year":"2010","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Grastien et al., 2011] Alban Grastien, Patrik Haslum, and Sylvie Thiébaux. Exhaustive diagnosis of discrete event systems through exploration of the hypothesis space. In DX, 2011.","title":"Exhaustive diagnosis of discrete event systems through exploration of the hypothesis space","authors":"Alban Grastien, Patrik Haslum, Sylvie Thiébaux","year":"2011","venue":"DX","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Grastien et al., 2012] Alban Grastien, Patrik Haslum, and Sylvie Thiébaux. Conflict-based diagnosis of discrete event systems: Theory and practice. In Proc. KR, pages 489-499, 2012.","title":"Conflict-based diagnosis of discrete event systems: Theory and practice","authors":"Alban Grastien, Patrik Haslum, Sylvie Thiébaux","year":"2012","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Haslum and Geffner, 2000] Patrik Haslum and Hector Geffner. Admissible heuristics for optimal planning. In Proc. AIPS, pages 140-149, 2000.","title":"Admissible heuristics for optimal planning","authors":"Geffner Haslum, Patrik Haslum, Hector Geffner","year":"2000","venue":"Proc. AIPS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Haslum, 2012] Patrik Haslum. Incremental lower bounds for addi- tive cost planning problems. In Proc. ICAPS, pages 74-82, 2012.","title":"Incremental lower bounds for additive cost planning problems","authors":"Patrik Haslum, Haslum","year":"2012","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward planning sys- tem. JAIR, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Helmert, 2009] Malte Helmert. Concise finite-domain representa- tions for PDDL planning tasks. AI, 173:503-535, 2009.","title":"Concise finite-domain representations for PDDL planning tasks","authors":"Malte Helmert, Helmert","year":"2009","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Katz et al., 2019] Michael Katz, Emil Keyder, Dominik Winterer, and Florian Pommerening. Oversubscription planning as classi- cal planning with multiple cost functions. In ICAPS, pages 237- 245, 2019.","title":"Oversubscription planning as classical planning with multiple cost functions","authors":"Katz","year":"2019","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Krarup et al., 2019] Benjamin Krarup, Michael Cashmore, Daniele Magazzeni, and Tim Miller. Towards model-based contrastive explanations for explainable planning. In ICAPS XAIP, 2019.","title":"Towards model-based contrastive explanations for explainable planning","authors":"Benjamin Krarup, Michael Cashmore, Daniele Magazzeni, Tim Miller","year":"2019","venue":"ICAPS XAIP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Laborie and Ghallab, 1995] Philippe Laborie and Malik Ghallab. Planning with sharable resource constraints. In IJCAI, pages 1643-1651, 1995.","title":"Planning with sharable resource constraints","authors":"Philippe Laborie, Malik Ghallab","year":"1995","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1995/212"},{"position":23,"raw":"[Laborie, 2014] Philippe Laborie. An optimal iterative algorithm for extracting MUCs in a black-box constraint network. In Proc. ECAI, pages 1051-1052, 2014.","title":"An optimal iterative algorithm for extracting MUCs in a black-box constraint network","authors":"Philippe Laborie","year":"2014","venue":"Proc. ECAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[McMillan, 1993] Kenneth L. McMillan. Symbolic Model Check- ing. Kluwer Academic Publishers, 1993.","title":"Symbolic Model Checking","authors":"L Kenneth, Mcmillan","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Miller, 2019] Tim Miller. Explanation in artificial intelligence: In- sights from the social sciences. AI, 267:1-38, 2019.","title":"Explanation in artificial intelligence: Insights from the social sciences","authors":"Tim Miller, Miller","year":"2019","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Nakhost et al., 2012] Hootan Nakhost, Jörg Hoffmann, and Martin Müller. Resource-constrained planning: A Monte Carlo random walk approach. In Proc. ICAPS, pages 181-189, 2012.","title":"Resource-constrained planning: A Monte Carlo random walk approach","authors":"Hootan Nakhost, Jörg Hoffmann, Martin Müller","year":"2012","venue":"Proc. ICAPS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Reiter, 1987] Raymond Reiter. A theory of diagnosis from first principles. AI, 32(1):57-95, 1987.","title":"A theory of diagnosis from first principles","authors":"Raymond Reiter","year":"1987","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rintanen, 2000] Jussi Rintanen. An iterative algorithm for synthe- sizing invariants. In Proc. AAAI, pages 806-811, 2000.","title":"An iterative algorithm for synthesizing invariants","authors":"Jussi Rintanen","year":"2000","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Smith, 2004] David E. Smith. Choosing objectives in over- subscription planning. In ICAPS, pages 393-401, 2004.","title":"Choosing objectives in oversubscription planning","authors":"David E Smith","year":"2004","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Smith, 2012] David Smith. Planning as an iterative process. In AAAI, pages 2180-2185, 2012.","title":"Planning as an iterative process","authors":"David Smith","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Sreedharan et al., 2019] Sarath Sreedharan, Siddharth Srivastava, David Smith, and Subbarao Kambhampati. Why can't you do that HAL? explaining unsolvability of planning tasks. In IJCAI, pages 1422-1430, 2019.","title":"Why can't you do that HAL? explaining unsolvability of planning tasks","authors":"Sarath Sreedharan, Siddharth Srivastava, David Smith, Subbarao Kambhampati","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/197"},{"position":32,"raw":"[Steinmetz and Hoffmann, 2017a] Marcel Steinmetz and Jörg Hoffmann. Search and learn: On dead-end detectors, the traps they set, and trap learning. In IJCAI, pages 4398-4404, 2017.","title":"Search and learn: On dead-end detectors, the traps they set, and trap learning","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/614"},{"position":33,"raw":"[Steinmetz and Hoffmann, 2017b] Marcel Steinmetz and Jörg Hoffmann. State space search nogood learning: On- line refinement of critical-path dead-end detectors in planning. AI, 245:1-37, 2017.","title":"State space search nogood learning: Online refinement of critical-path dead-end detectors in planning","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2017","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Torralba et al., 2014] Álvaro Torralba, Vidal Alcázar, Daniel Bor- rajo, Peter Kissmann, and Stefan Edelkamp. SymBA*: A sym- bolic bidirectional A* planner. In IPC 2014 abstracts, 2014.","title":"SymBA*: A symbolic bidirectional A* planner","authors":"Álvaro Torralba, Daniel Vidal Alcázar, Peter Borrajo, Stefan Kissmann, Edelkamp","year":"2014","venue":"IPC 2014 abstracts","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Torralba et al., 2017] Álvaro Torralba, Vidal Alcázar, Peter Kiss- mann, and Stefan Edelkamp. Efficient symbolic search for cost- optimal planning. AI, 242:52-79, 2017.","title":"Efficient symbolic search for costoptimal planning","authors":"Álvaro Torralba, Peter Vidal Alcázar, Stefan Kissmann, Edelkamp","year":"2017","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Torres and Baier, 2015] Jorge Torres and Jorge A Baier. Polynomial-time reformulations of LTL temporally extended goals into final-state goals. In IJCAI, pages 1696-1703, 2015.","title":"Polynomial-time reformulations of LTL temporally extended goals into final-state goals","authors":"Jorge Torres, Jorge A Baier","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/242"},{"position":37,"raw":"[Vaquero et al., 2013] Tiago Stegun Vaquero, José Reinaldo Silva, Flavio Tonidandel, and J. Christopher Beck. itSIMPLE: To- wards an integrated design system for real planning applications. Knowledge Engineering Review, 28(2):215-230, 2013.","title":"itSIMPLE: Towards an integrated design system for real planning applications","authors":"Stegun Tiago, Vaquero, Reinaldo José, Flavio Silva, J Christopher Tonidandel, Beck","year":"2013","venue":"Knowledge Engineering Review","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Yu et al., 2017] Peng Yu, Brian Charles Williams, Cheng Fang, Jing Cui, and Patrik Haslum. Resolving over-constrained tem- poral problems with uncertainty through conflict-directed relax- ation. JAIR, 60:425-490, 2017.","title":"Resolving over-constrained temporal problems with uncertainty through conflict-directed relaxation","authors":"Peng Yu, Brian Charles Williams, Cheng Fang, Jing Cui, Patrik Haslum","year":"2017","venue":"JAIR","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}