On the Computational Complexity of Model Reconciliations

Sarath Sreedharan; Pascal Bercher; Subbarao Kambhampati

On the Computational Complexity of Model Reconciliations

Sarath Sreedharan, Pascal Bercher, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 Σ^P₂ -complete.

Original language	English (US)
Title of host publication	Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022
Editors	Luc De Raedt, Luc De Raedt
Publisher	International Joint Conferences on Artificial Intelligence
Pages	4657-4664
Number of pages	8
ISBN (Electronic)	9781956792003
State	Published - 2022
Externally published	Yes
Event	31st International Joint Conference on Artificial Intelligence, IJCAI 2022 - Vienna, Austria Duration: Jul 23 2022 → Jul 29 2022

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)	1045-0823

Conference

Conference	31st International Joint Conference on Artificial Intelligence, IJCAI 2022
Country/Territory	Austria
City	Vienna
Period	7/23/22 → 7/29/22

ASJC Scopus subject areas

Artificial Intelligence

Cite this

Sreedharan, S., Bercher, P., & Kambhampati, S. (2022). On the Computational Complexity of Model Reconciliations. In L. De Raedt, & L. De Raedt (Eds.), Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 (pp. 4657-4664). (IJCAI International Joint Conference on Artificial Intelligence). International Joint Conferences on Artificial Intelligence.

On the Computational Complexity of Model Reconciliations. / Sreedharan, Sarath; Bercher, Pascal; Kambhampati, Subbarao.
Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022. ed. / Luc De Raedt; Luc De Raedt. International Joint Conferences on Artificial Intelligence, 2022. p. 4657-4664 (IJCAI International Joint Conference on Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sreedharan, S, Bercher, P & Kambhampati, S 2022, On the Computational Complexity of Model Reconciliations. in L De Raedt & L De Raedt (eds), Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022. IJCAI International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, pp. 4657-4664, 31st International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 7/23/22.

Sreedharan S, Bercher P, Kambhampati S. On the Computational Complexity of Model Reconciliations. In De Raedt L, De Raedt L, editors, Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022. International Joint Conferences on Artificial Intelligence. 2022. p. 4657-4664. (IJCAI International Joint Conference on Artificial Intelligence).

Sreedharan, Sarath ; Bercher, Pascal ; Kambhampati, Subbarao. / On the Computational Complexity of Model Reconciliations. Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022. editor / Luc De Raedt ; Luc De Raedt. International Joint Conferences on Artificial Intelligence, 2022. pp. 4657-4664 (IJCAI International Joint Conference on Artificial Intelligence).

@inproceedings{3152511bf696471aaaa86bffc9ad58ac,

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 = "Funding Information: This research is supported in part by ONR grants N00014-16-1-2892, N00014-18-1-2442, N00014-18-1-2840, N00014-9-1-2119, AFOSR grant FA9550-18-1-0067, DARPA SAIL-ON grant W911NF19-2-0006 and a JP Morgan AI Faculty Research grant. 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",

language = "English (US)",

series = "IJCAI International Joint Conference on Artificial Intelligence",

publisher = "International Joint Conferences on Artificial Intelligence",

pages = "4657--4664",

editor = "{De Raedt}, Luc and {De Raedt}, Luc",

booktitle = "Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022",

}

TY - GEN

T1 - On the Computational Complexity of Model Reconciliations

AU - Sreedharan, Sarath

AU - Bercher, Pascal

AU - Kambhampati, Subbarao

N1 - Funding Information: This research is supported in part by ONR grants N00014-16-1-2892, N00014-18-1-2442, N00014-18-1-2840, N00014-9-1-2119, AFOSR grant FA9550-18-1-0067, DARPA SAIL-ON grant W911NF19-2-0006 and a JP Morgan AI Faculty Research grant. Publisher Copyright: © 2022 International Joint Conferences on Artificial Intelligence. All rights reserved.

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85137939924&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85137939924&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85137939924

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 4657

EP - 4664

BT - Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022

A2 - De Raedt, Luc

PB - International Joint Conferences on Artificial Intelligence

T2 - 31st International Joint Conference on Artificial Intelligence, IJCAI 2022

Y2 - 23 July 2022 through 29 July 2022

ER -

On the Computational Complexity of Model Reconciliations

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this