TY - CHAP
T1 - A New Approach to Plan-Space Explanation
T2 - 34th AAAI Conference on Artificial Intelligence, AAAI 2020
AU - Eifler, Rebecca
AU - Cashmore, Michael
AU - Hoffmann, Jorg
AU - Magazzeni, Daniele
AU - Steinmetz, Marcel
N1 - Publisher Copyright:
Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2020
Y1 - 2020
N2 - In many usage scenarios of AI Planning technology, users will want not just a plan ? but an explanation of the space of possible plans, justifying ?. In particular, in oversubscription planning where not all goals can be achieved, users may ask why a conjunction A of goals is not achieved by ?. We propose to answer this kind of question with the goal conjunctions B excluded by A, i. e., that could not be achieved if A were to be enforced. We formalize this approach in terms of plan-property dependencies, where plan properties are propositional formulas over the goals achieved by a plan, and dependencies are entailment relations in plan space. We focus on entailment relations of the form g?A g g?B g, and devise analysis techniques globally identifying all such relations, or locally identifying the implications of a single given plan property (user question) g?A g. We show how, via compilation, one can analyze dependencies between a richer form of plan properties, specifying formulas over action subsets touched by the plan. We run comprehensive experiments on adapted IPC benchmarks, and find that the suggested analyses are reasonably feasible at the global level, and become significantly more effective at the local level.
AB - In many usage scenarios of AI Planning technology, users will want not just a plan ? but an explanation of the space of possible plans, justifying ?. In particular, in oversubscription planning where not all goals can be achieved, users may ask why a conjunction A of goals is not achieved by ?. We propose to answer this kind of question with the goal conjunctions B excluded by A, i. e., that could not be achieved if A were to be enforced. We formalize this approach in terms of plan-property dependencies, where plan properties are propositional formulas over the goals achieved by a plan, and dependencies are entailment relations in plan space. We focus on entailment relations of the form g?A g g?B g, and devise analysis techniques globally identifying all such relations, or locally identifying the implications of a single given plan property (user question) g?A g. We show how, via compilation, one can analyze dependencies between a richer form of plan properties, specifying formulas over action subsets touched by the plan. We run comprehensive experiments on adapted IPC benchmarks, and find that the suggested analyses are reasonably feasible at the global level, and become significantly more effective at the local level.
UR - http://www.scopus.com/inward/record.url?scp=85091984604&partnerID=8YFLogxK
M3 - Conference paper
AN - SCOPUS:85091984604
T3 - AAAI 2020 - 34th AAAI Conference on Artificial Intelligence
SP - 9818
EP - 9826
BT - AAAI 2020 - 34th AAAI Conference on Artificial Intelligence
PB - AAAI Press
Y2 - 7 February 2020 through 12 February 2020
ER -