@InProceedings{Lin2023ImprovedHTNVerifyViaSAT,
  author     = {Songtuan Lin and Gregor Behnke and Pascal Bercher},
  title      = {Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning},
  booktitle  = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)},
  year       = {2023},
  publisher  = {IOS Press},
  pages      = {1489--1496},
  abstract   = {Plan verification is the task of deciding whether a given plan is a solution to a planning problem. In this paper, we study the plan verification problem in the context of Hierarchical Task Network (HTN) planning, which has been proved to be NP-complete when partial order (PO) is involved. We will develop a novel SAT-based approach exploiting the data structures solution order graphs and path decomposition trees which encodes an HTN plan verification problem as a SAT one. We show in our experiments that this new approach outperforms the current state-of-the-art (SOTA) planning-based approach for verifying plans for POHTN problems.},
  doi        = {10.3233/FAIA230428},
  url_Paper  = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSAT.pdf},
  url_Poster = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATPoster.pdf},
  url_Slides = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATSlides.pdf},
  url_zenodo = {https://zenodo.org/records/10906075},
  keywords   = {conference}
}

{"_id":"uZhPspH2RW96iPsDG","bibbaseid":"lin-behnke-bercher-acceleratingsatbasedhtnplanverificationbyexploitingdatastructuresfromhtnplanning-2023","author_short":["Lin, S.","Behnke, G.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Gregor"],"propositions":[],"lastnames":["Behnke"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning","booktitle":"Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)","year":"2023","publisher":"IOS Press","pages":"1489–1496","abstract":"Plan verification is the task of deciding whether a given plan is a solution to a planning problem. In this paper, we study the plan verification problem in the context of Hierarchical Task Network (HTN) planning, which has been proved to be NP-complete when partial order (PO) is involved. We will develop a novel SAT-based approach exploiting the data structures solution order graphs and path decomposition trees which encodes an HTN plan verification problem as a SAT one. We show in our experiments that this new approach outperforms the current state-of-the-art (SOTA) planning-based approach for verifying plans for POHTN problems.","doi":"10.3233/FAIA230428","url_paper":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSAT.pdf","url_poster":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATPoster.pdf","url_slides":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATSlides.pdf","url_zenodo":"https://zenodo.org/records/10906075","keywords":"conference","bibtex":"@InProceedings{Lin2023ImprovedHTNVerifyViaSAT,\n author = {Songtuan Lin and Gregor Behnke and Pascal Bercher},\n title = {Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning},\n booktitle = {Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)},\n year = {2023},\n publisher = {IOS Press},\n pages = {1489--1496},\n abstract = {Plan verification is the task of deciding whether a given plan is a solution to a planning problem. In this paper, we study the plan verification problem in the context of Hierarchical Task Network (HTN) planning, which has been proved to be NP-complete when partial order (PO) is involved. We will develop a novel SAT-based approach exploiting the data structures solution order graphs and path decomposition trees which encodes an HTN plan verification problem as a SAT one. We show in our experiments that this new approach outperforms the current state-of-the-art (SOTA) planning-based approach for verifying plans for POHTN problems.},\n doi = {10.3233/FAIA230428},\n url_Paper = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSAT.pdf},\n url_Poster = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATPoster.pdf},\n url_Slides = {https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATSlides.pdf},\n url_zenodo = {https://zenodo.org/records/10906075},\n keywords = {conference}\n}\n\n","author_short":["Lin, S.","Behnke, G.","Bercher, P."],"key":"Lin2023ImprovedHTNVerifyViaSAT","id":"Lin2023ImprovedHTNVerifyViaSAT","bibbaseid":"lin-behnke-bercher-acceleratingsatbasedhtnplanverificationbyexploitingdatastructuresfromhtnplanning-2023","role":"author","urls":{" paper":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSAT.pdf"," poster":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATPoster.pdf"," slides":"https://bercher.net/publications/2023/Lin2023ImprovedHTNVerifyViaSATSlides.pdf"," zenodo":"https://zenodo.org/records/10906075"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":8},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","rta5EvLvgMEDFTyZk","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["accelerating","sat","based","htn","plan","verification","exploiting","data","structures","htn","planning","lin","behnke","bercher"],"title":"Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning","year":2023,"downloads":8}