@InProceedings{Lauer2025LiftedHTNVerification,
  author    = {Pascal Lauer and Songtuan Lin and Pascal Bercher},
  booktitle = {Proceedings of the 35th International Conference on Automated Planning and Scheduling ({ICAPS 2025})},
  title     = {Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence},
  year      = {2025},
  publisher = {AAAI Press},
  abstract  = {Plan verification is a canonical problem within any planning setting, to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hierarchical Task Network (HTN) Planning. On top of the general analysis, we impose constraints on method orderings and the amount of tasks that methods decompose to. This pinpoints subclasses with lower complexity. Our results confirm the existence of more efficient algorithms when operating on the lifted, instead of grounded, representation.},
  keywords  = {conference,DECRA}
}

{"_id":"xkhjQa4cSLfYvxBui","bibbaseid":"lauer-lin-bercher-tightboundsforliftedhtnplanverificationandboundedplanexistence-2025","author_short":["Lauer, P.","Lin, S.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Pascal"],"propositions":[],"lastnames":["Lauer"],"suffixes":[]},{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"booktitle":"Proceedings of the 35th International Conference on Automated Planning and Scheduling (ICAPS 2025)","title":"Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence","year":"2025","publisher":"AAAI Press","abstract":"Plan verification is a canonical problem within any planning setting, to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hierarchical Task Network (HTN) Planning. On top of the general analysis, we impose constraints on method orderings and the amount of tasks that methods decompose to. This pinpoints subclasses with lower complexity. Our results confirm the existence of more efficient algorithms when operating on the lifted, instead of grounded, representation.","keywords":"conference,DECRA","bibtex":"@InProceedings{Lauer2025LiftedHTNVerification,\n author = {Pascal Lauer and Songtuan Lin and Pascal Bercher},\n booktitle = {Proceedings of the 35th International Conference on Automated Planning and Scheduling ({ICAPS 2025})},\n title = {Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence},\n year = {2025},\n publisher = {AAAI Press},\n abstract = {Plan verification is a canonical problem within any planning setting, to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hierarchical Task Network (HTN) Planning. On top of the general analysis, we impose constraints on method orderings and the amount of tasks that methods decompose to. This pinpoints subclasses with lower complexity. Our results confirm the existence of more efficient algorithms when operating on the lifted, instead of grounded, representation.},\n keywords = {conference,DECRA}\n}\n\n","author_short":["Lauer, P.","Lin, S.","Bercher, P."],"key":"Lauer2025LiftedHTNVerification","id":"Lauer2025LiftedHTNVerification","bibbaseid":"lauer-lin-bercher-tightboundsforliftedhtnplanverificationandboundedplanexistence-2025","role":"author","urls":{},"keyword":["conference","DECRA"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["bPpsmYWjffAy6QHP5"],"keywords":["conference","decra"],"search_terms":["tight","bounds","lifted","htn","plan","verification","bounded","plan","existence","lauer","lin","bercher"],"title":"Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence","year":2025}