1. Alford, R., Bercher, P., Aha, D.W.: Tight bounds for HTN planning. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS), pp. 7–15. AAAI Press (2015)
2. Alford, R., Bercher, P., Aha, D.W.: Tight bounds for HTN planning with task insertion. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI). pp. 1502–1508. AAAI Press (2015)
3. Alford, R., Shivashankar, V., Kuter, U., Nau, D.S.: HTN problem spaces: structure, algorithms, termination. In: Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS), pp. 2–9. AAAI Press (2012)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);R Barták,2017
5. Behnke, G., Höller, D., Bercher, P., Biundo, S.: Change the plan - how hard can that be? In: Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS), pp. 38–46. AAAI Press (2016)