On the Complexity of HTN Plan Verification and Its Implications for Plan Recognition. Behnke, G., Höller, D., & Biundo, S. In Brafman, R. I., Domshlak, C., Haslum, P., & Zilberstein, S., editors, Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2015, Jerusalem, Israel, June 7-11, 2015, pages 25–33, 2015. AAAI Press.
On the Complexity of HTN Plan Verification and Its Implications for Plan Recognition [link]Paper  bibtex   
@inproceedings{DBLP:conf/aips/BehnkeHB15,
  author    = {Gregor Behnke and
               Daniel H{\"{o}}ller and
               Susanne Biundo},
  editor    = {Ronen I. Brafman and
               Carmel Domshlak and
               Patrik Haslum and
               Shlomo Zilberstein},
  title     = {On the Complexity of {HTN} Plan Verification and Its Implications
               for Plan Recognition},
  booktitle = {Proceedings of the Twenty-Fifth International Conference on Automated
               Planning and Scheduling, {ICAPS} 2015, Jerusalem, Israel, June 7-11,
               2015},
  pages     = {25--33},
  publisher = {{AAAI} Press},
  year      = {2015},
  url       = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10620},
  timestamp = {Tue, 26 May 2015 21:03:02 +0200},
  biburl    = {https://dblp.org/rec/conf/aips/BehnkeHB15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0