@inproceedings{ec8d8bf45861457b85d8bef401d986d4,
title = "On the Computational Complexity of Model Reconciliations",
abstract = "Model-reconciliation explanation is a popular framework for generating explanations for planning problems. While the framework has been extended to multiple settings since its introduction for classical planning problems, there is little agreement on the computational complexity of generating minimal model reconciliation explanations in the basic setting. In this paper, we address this lacuna by introducing a decision-version of the model-reconciliation explanation generation problem and we show that it is ΣP2 -complete.",
author = "Sarath Sreedharan and Pascal Bercher and Subbarao Kambhampati",
note = "Publisher Copyright: {\textcopyright} 2022 International Joint Conferences on Artificial Intelligence. All rights reserved.; 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 ; Conference date: 23-07-2022 Through 29-07-2022",
year = "2022",
month = jul,
day = "23",
doi = "10.24963/ijcai.2022/646",
language = "English",
volume = "31",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence (IJCAI)",
pages = "4657--4664",
editor = "\{De Raedt\}, Luc",
booktitle = "Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence",
}