@InProceedings{Bartak2020ParsingApproach,
  author    = {Roman Bart{\'a}k and Simona Ondr\v{c}kov\'{a} and Adrien Maillard and Gregor Behnke and Pascal Bercher},
  title     = {A Novel Parsing-based Approach for Verification of Hierarchical Plans},
  booktitle = {Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020)},
  year      = {2020},
  publisher = {IEEE},
  pages     = {118--125},
  doi       = {10.1109/ICTAI50040.2020.00029},
  abstract  = {Hierarchical Task Networks were proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Valid plans -- sequences of actions -- must adhere both to causal dependencies between the actions and to the structure given by the decomposition of the goal task. Plan verification aims at finding if a given plan is valid, that is, if it is causally consistent and it can be obtained by decomposition of some task. The paper describes a novel parsing-based approach for hierarchical plan verification that is orders of magnitude faster than existing methods.},
  url_Paper = {https://bercher.net/publications/2020/Bartak2020HTNVerification.pdf},
  keywords  = {conference}
}

{"_id":"DYrjW79KgnrpPKius","bibbaseid":"bartk-ondrkov-maillard-behnke-bercher-anovelparsingbasedapproachforverificationofhierarchicalplans-2020","author_short":["Barták, R.","Ondrčková, S.","Maillard, A.","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":["Adrien"],"propositions":[],"lastnames":["Maillard"],"suffixes":[]},{"firstnames":["Gregor"],"propositions":[],"lastnames":["Behnke"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"A Novel Parsing-based Approach for Verification of Hierarchical Plans","booktitle":"Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020)","year":"2020","publisher":"IEEE","pages":"118–125","doi":"10.1109/ICTAI50040.2020.00029","abstract":"Hierarchical Task Networks were proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Valid plans – sequences of actions – must adhere both to causal dependencies between the actions and to the structure given by the decomposition of the goal task. Plan verification aims at finding if a given plan is valid, that is, if it is causally consistent and it can be obtained by decomposition of some task. The paper describes a novel parsing-based approach for hierarchical plan verification that is orders of magnitude faster than existing methods.","url_paper":"https://bercher.net/publications/2020/Bartak2020HTNVerification.pdf","keywords":"conference","bibtex":"@InProceedings{Bartak2020ParsingApproach,\n author = {Roman Bart{\\'a}k and Simona Ondr\\v{c}kov\\'{a} and Adrien Maillard and Gregor Behnke and Pascal Bercher},\n title = {A Novel Parsing-based Approach for Verification of Hierarchical Plans},\n booktitle = {Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2020)},\n year = {2020},\n publisher = {IEEE},\n pages = {118--125},\n doi = {10.1109/ICTAI50040.2020.00029},\n abstract = {Hierarchical Task Networks were proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Valid plans -- sequences of actions -- must adhere both to causal dependencies between the actions and to the structure given by the decomposition of the goal task. Plan verification aims at finding if a given plan is valid, that is, if it is causally consistent and it can be obtained by decomposition of some task. The paper describes a novel parsing-based approach for hierarchical plan verification that is orders of magnitude faster than existing methods.},\n url_Paper = {https://bercher.net/publications/2020/Bartak2020HTNVerification.pdf},\n keywords = {conference}\n}\n\n","author_short":["Barták, R.","Ondrčková, S.","Maillard, A.","Behnke, G.","Bercher, P."],"key":"Bartak2020ParsingApproach","id":"Bartak2020ParsingApproach","bibbaseid":"bartk-ondrkov-maillard-behnke-bercher-anovelparsingbasedapproachforverificationofhierarchicalplans-2020","role":"author","urls":{" paper":"https://bercher.net/publications/2020/Bartak2020HTNVerification.pdf"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["wYF8yPQT6a4TgShWe","bPpsmYWjffAy6QHP5"],"keywords":["conference"],"search_terms":["novel","parsing","based","approach","verification","hierarchical","plans","barták","ondrčková","maillard","behnke","bercher"],"title":"A Novel Parsing-based Approach for Verification of Hierarchical Plans","year":2020,"downloads":1}