@InProceedings{Lin2021FixHTNModel,
  author          = {Songtuan Lin and Pascal Bercher},
  title           = {Change the World -- How Hard Can that Be? On the Computational Complexity of Fixing Planning Models},
  booktitle       = {Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021)},
  year            = {2021},
  publisher       = {IJCAI},
  abstract        = {Incorporating humans into AI planning is an important feature of flexible planning technology. Such human integration allows to incorporate previously unknown constraints, and is also an integral part of automated modeling assistance. As a foundation for integrating user requests, we study the computational complexity of determining the existence of changes to an existing model, such that the resulting model allows for specific user-provided solutions. We are provided with a planning problem modeled either in the classical (non-hierarchical) or hierarchical task network (HTN) planning formalism, as well as with a supposed-to-be solution plan, which is actually not a solution for the current model. Considering changing decomposition methods as well as preconditions and effects of actions, we show that most change requests are NP-complete though some turn out to be tractable.},
  pages           = {4152--4159},
  doi             = {10.24963/ijcai.2021/571},
  url_Paper       = {https://bercher.net/publications//2021/Lin2021ChangeTheWorld.pdf},
  url_Slides      = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides.pdf},
  url_Slides-4on1 = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides4on1.pdf},
  url_Poster      = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldPoster.pdf},
  keywords        = {conference}
}

{"_id":"oZfyoTLgfQRgwx2mG","bibbaseid":"lin-bercher-changetheworldhowhardcanthatbeonthecomputationalcomplexityoffixingplanningmodels-2021","author_short":["Lin, S.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"Change the World – How Hard Can that Be? On the Computational Complexity of Fixing Planning Models","booktitle":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021)","year":"2021","publisher":"IJCAI","abstract":"Incorporating humans into AI planning is an important feature of flexible planning technology. Such human integration allows to incorporate previously unknown constraints, and is also an integral part of automated modeling assistance. As a foundation for integrating user requests, we study the computational complexity of determining the existence of changes to an existing model, such that the resulting model allows for specific user-provided solutions. We are provided with a planning problem modeled either in the classical (non-hierarchical) or hierarchical task network (HTN) planning formalism, as well as with a supposed-to-be solution plan, which is actually not a solution for the current model. Considering changing decomposition methods as well as preconditions and effects of actions, we show that most change requests are NP-complete though some turn out to be tractable.","pages":"4152–4159","doi":"10.24963/ijcai.2021/571","url_paper":"https://bercher.net/publications//2021/Lin2021ChangeTheWorld.pdf","url_slides":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides.pdf","url_slides-4on1":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides4on1.pdf","url_poster":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldPoster.pdf","keywords":"conference","bibtex":"@InProceedings{Lin2021FixHTNModel,\n author = {Songtuan Lin and Pascal Bercher},\n title = {Change the World -- How Hard Can that Be? On the Computational Complexity of Fixing Planning Models},\n booktitle = {Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021)},\n year = {2021},\n publisher = {IJCAI},\n abstract = {Incorporating humans into AI planning is an important feature of flexible planning technology. Such human integration allows to incorporate previously unknown constraints, and is also an integral part of automated modeling assistance. As a foundation for integrating user requests, we study the computational complexity of determining the existence of changes to an existing model, such that the resulting model allows for specific user-provided solutions. We are provided with a planning problem modeled either in the classical (non-hierarchical) or hierarchical task network (HTN) planning formalism, as well as with a supposed-to-be solution plan, which is actually not a solution for the current model. Considering changing decomposition methods as well as preconditions and effects of actions, we show that most change requests are NP-complete though some turn out to be tractable.},\n pages = {4152--4159},\n doi = {10.24963/ijcai.2021/571},\n url_Paper = {https://bercher.net/publications//2021/Lin2021ChangeTheWorld.pdf},\n url_Slides = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides.pdf},\n url_Slides-4on1 = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides4on1.pdf},\n url_Poster = {https://bercher.net/publications//2021/Lin2021ChangeTheWorldPoster.pdf},\n keywords = {conference}\n}\n\n","author_short":["Lin, S.","Bercher, P."],"key":"Lin2021FixHTNModel","id":"Lin2021FixHTNModel","bibbaseid":"lin-bercher-changetheworldhowhardcanthatbeonthecomputationalcomplexityoffixingplanningmodels-2021","role":"author","urls":{" paper":"https://bercher.net/publications//2021/Lin2021ChangeTheWorld.pdf"," slides":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides.pdf"," slides-4on1":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldSlides4on1.pdf"," poster":"https://bercher.net/publications//2021/Lin2021ChangeTheWorldPoster.pdf"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":43},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["Gq638hec4HPziarNx","zKgS72cAu6Ez7npdh","WvkzCyK6mKXCp2WFz","rta5EvLvgMEDFTyZk","BLJPWpPi3hneTGaPF","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["change","world","hard","computational","complexity","fixing","planning","models","lin","bercher"],"title":"Change the World – How Hard Can that Be? On the Computational Complexity of Fixing Planning Models","year":2021,"downloads":43}