1. Balcázar, J.L.: The complexity of searching implicit graphs. AIJ 86(1), 171–188 (1996)
2. Banihashemi, B., De Giacomo, G., Lespérance, Y.: Abstraction in situation calculus action theories. In: Proceedings of AAAI, pp. 1048–1055 (2017)
3. Baral, C., Eiter, T., Bjäreland, M., Nakamura, M.: Maintenance goals of agents in a dynamic environment: formulation and policy construction. AIJ 172(12), 1429–1469 (2008)
4. Behnke, G., Höller, D., Biundo, S.: On the complexity of HTN plan verification and its implications for plan recognition. In: Proceedings of ICAPS, pp. 25–33 (2015)
5. Lecture Notes in Computer Science;J Blount,2015