@InProceedings{Bartak2021TOHTNVerification,
  author     = {Roman Bart{\'a}k and Simona Ondr\v{c}kov\'{a} and Gregor Behnke and Pascal Bercher},
  title      = {On the Verification of Totally-Ordered HTN Plans},
  booktitle  = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},
  year       = {2021},
  pages      = {44--48},
  abstract   = {Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans. This problem is known to be tractable, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.},
  url_Paper  = {https://bercher.net/publications/2021/Bartak2021TOHTNVerification.pdf},
  keywords   = {workshop}
}

{"_id":"ZGHszxZZG8WG9gHN4","bibbaseid":"bartk-ondrkov-behnke-bercher-ontheverificationoftotallyorderedhtnplans-2021","author_short":["Barták, R.","Ondrčková, S.","Behnke, G.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Roman"],"propositions":[],"lastnames":["Barták"],"suffixes":[]},{"firstnames":["Simona"],"propositions":[],"lastnames":["Ondrčková"],"suffixes":[]},{"firstnames":["Gregor"],"propositions":[],"lastnames":["Behnke"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"On the Verification of Totally-Ordered HTN Plans","booktitle":"Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)","year":"2021","pages":"44–48","abstract":"Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans. This problem is known to be tractable, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.","url_paper":"https://bercher.net/publications/2021/Bartak2021TOHTNVerification.pdf","keywords":"workshop","bibtex":"@InProceedings{Bartak2021TOHTNVerification,\n author = {Roman Bart{\\'a}k and Simona Ondr\\v{c}kov\\'{a} and Gregor Behnke and Pascal Bercher},\n title = {On the Verification of Totally-Ordered HTN Plans},\n booktitle = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},\n year = {2021},\n pages = {44--48},\n abstract = {Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans. This problem is known to be tractable, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.},\n url_Paper = {https://bercher.net/publications/2021/Bartak2021TOHTNVerification.pdf},\n keywords = {workshop}\n}\n\n","author_short":["Barták, R.","Ondrčková, S.","Behnke, G.","Bercher, P."],"key":"Bartak2021TOHTNVerification","id":"Bartak2021TOHTNVerification","bibbaseid":"bartk-ondrkov-behnke-bercher-ontheverificationoftotallyorderedhtnplans-2021","role":"author","urls":{" paper":"https://bercher.net/publications/2021/Bartak2021TOHTNVerification.pdf"},"keyword":["workshop"],"metadata":{"authorlinks":{}},"downloads":9},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["T9LQLt3D2MDhrCfjh","jTtEZEw8NJc375xGA","wYF8yPQT6a4TgShWe","bPpsmYWjffAy6QHP5"],"keywords":["workshop"],"search_terms":["verification","totally","ordered","htn","plans","barták","ondrčková","behnke","bercher"],"title":"On the Verification of Totally-Ordered HTN Plans","year":2021,"downloads":9}