TY - GEN
T1 - Conditional updates of answer set programming and its application in explainable planning
AU - Nguyen, Van
AU - Son, Tran Cao
AU - Vasileiou, Stylianos Loukas
AU - Yeoh, William
N1 - Publisher Copyright:
© 2020 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). All rights reserved.
PY - 2020
Y1 - 2020
N2 - In explainable planning, the planning agent needs to explain its plan to a human user, especially when the plan appears infeasible or suboptimal for the user. A popular approach is called model reconciliation, where the agent reconciles the differences between its model and the model of the user such that its plan is also feasible and optimal to the user. This problem can be viewed as a more general problem as follows: Given two knowledge bases πa and πh and a query q such that πa entails q and πh does not entail q, where the notion of entailment is dependent on the logical theories underlying πa and πh, how to change πh - given πa and the support for q in πa - so that πh does entail q. In this paper, we study this problem under the context of answer set programming. To achieve this goal, we (1) define the notion of a conditional update between two logic programs πa and πh with respect to a query q; (2) define the notion of an explanation for a query q from a program πa to a program πh using conditional updates; (3) develop algorithms for computing explanations; and (4) show how the notion of explanation based on conditional updates can be used in explainable planning.
AB - In explainable planning, the planning agent needs to explain its plan to a human user, especially when the plan appears infeasible or suboptimal for the user. A popular approach is called model reconciliation, where the agent reconciles the differences between its model and the model of the user such that its plan is also feasible and optimal to the user. This problem can be viewed as a more general problem as follows: Given two knowledge bases πa and πh and a query q such that πa entails q and πh does not entail q, where the notion of entailment is dependent on the logical theories underlying πa and πh, how to change πh - given πa and the support for q in πa - so that πh does entail q. In this paper, we study this problem under the context of answer set programming. To achieve this goal, we (1) define the notion of a conditional update between two logic programs πa and πh with respect to a query q; (2) define the notion of an explanation for a query q from a program πa to a program πh using conditional updates; (3) develop algorithms for computing explanations; and (4) show how the notion of explanation based on conditional updates can be used in explainable planning.
KW - Answer Set Programming
KW - Explainable Planning
UR - https://www.scopus.com/pages/publications/85096680991
M3 - Conference contribution
AN - SCOPUS:85096680991
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1954
EP - 1956
BT - Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
A2 - An, Bo
A2 - El Fallah Seghrouchni, Amal
A2 - Sukthankar, Gita
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
Y2 - 19 May 2020
ER -