@InProceedings{Sreedharan2022ModelReconciliationComplexity,
  author                    = {Sarath Sreedharan and Pascal Bercher and Subbarao Kambhampati},
  booktitle                 = {Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)},
  title                     = {On the Computational Complexity of Model Reconciliations},
  year                      = {2022},
  pages                     = {4657--4664},
  doi                       = {10.24963/ijcai.2022/646},
  publisher                 = {IJCAI},
  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 Sigma2-complete.},
  url_Paper                 = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexity.pdf},
  url_Poster                = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexityPoster.pdf},
  url_Slides                = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexitySlides.pdf},
  url_video_of_presentation = {https://www.ijcai.org/proceedings/2022/video/646},
  keywords                  = {conference}
}

{"_id":"LCmGn4yNn73jLvtGx","bibbaseid":"sreedharan-bercher-kambhampati-onthecomputationalcomplexityofmodelreconciliations-2022","author_short":["Sreedharan, S.","Bercher, P.","Kambhampati, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Sarath"],"propositions":[],"lastnames":["Sreedharan"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]},{"firstnames":["Subbarao"],"propositions":[],"lastnames":["Kambhampati"],"suffixes":[]}],"booktitle":"Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)","title":"On the Computational Complexity of Model Reconciliations","year":"2022","pages":"4657–4664","doi":"10.24963/ijcai.2022/646","publisher":"IJCAI","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 Sigma2-complete.","url_paper":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexity.pdf","url_poster":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexityPoster.pdf","url_slides":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexitySlides.pdf","url_video_of_presentation":"https://www.ijcai.org/proceedings/2022/video/646","keywords":"conference","bibtex":"@InProceedings{Sreedharan2022ModelReconciliationComplexity,\n author = {Sarath Sreedharan and Pascal Bercher and Subbarao Kambhampati},\n booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)},\n title = {On the Computational Complexity of Model Reconciliations},\n year = {2022},\n pages = {4657--4664},\n doi = {10.24963/ijcai.2022/646},\n publisher = {IJCAI},\n 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 Sigma2-complete.},\n url_Paper = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexity.pdf},\n url_Poster = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexityPoster.pdf},\n url_Slides = {https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexitySlides.pdf},\n url_video_of_presentation = {https://www.ijcai.org/proceedings/2022/video/646},\n keywords = {conference}\n}\n\n","author_short":["Sreedharan, S.","Bercher, P.","Kambhampati, S."],"key":"Sreedharan2022ModelReconciliationComplexity","id":"Sreedharan2022ModelReconciliationComplexity","bibbaseid":"sreedharan-bercher-kambhampati-onthecomputationalcomplexityofmodelreconciliations-2022","role":"author","urls":{" paper":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexity.pdf"," poster":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexityPoster.pdf"," slides":"https://bercher.net/publications/2022/Sreedharan2022ModelReconciliationComplexitySlides.pdf"," video of presentation":"https://www.ijcai.org/proceedings/2022/video/646"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":19},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["computational","complexity","model","reconciliations","sreedharan","bercher","kambhampati"],"title":"On the Computational Complexity of Model Reconciliations","year":2022,"downloads":19}