Backstrom, C., & Nebel, B. (1995). Complexity results for SAS+ planning. Computational Intelligence, 11 (4), 625–655.

Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Canada.

Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90 (1–2), 281–300.

Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In Proceedings of the Fifth European Conference on Planning (ECP-99) Durham, UK.

Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 714-719 Providence, RI.

Borrajo, D., & Veloso, M. (1997). Lazy incremental learning of control knowledge for efficiently obtaining quality plans. AI Review, 11, 371–405.

Bylander, T. (1994). The computation complexity of propositional strips. Artificial Intelligence, 69(1-2), 165–204.

Carbonell, J. G., Knoblock, C. A., & Minton, S. (1991). PRODIGY: An integrated architecture for planning and learning. In VanLehn, K. (Ed.), Architectures for Intelligence, p. 241–278. Lawrence Erlbaum, Hillsdale, NJ.

Cherniack, M., & Zdonik, S. B. (1996). Rule languages and internal algebras for rule-based optimizers. SIGMOD Record (ACM Special Interest Group on Management of Data),
25 (2), 401–412.

Cherniack, M., & Zdonik, S. B. (1998). Changing the rules: Transformations for rulebased optimizers. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 61-72 Seattle, WA.

Dean, T., & Boddy, M. (1988). An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence, pp. 49–54 Saint Paul, MN.

Dorr, H. (1995). Efficient graph rewriting and its implementation, Vol. 922 of Lecture Notes in Computer Science. Springer-Verlag Inc., New York, NY, USA.

Erol, K., Nau, D., & Hendler, J. (1994). UMCP: A sound and complete planning procedure for hierarchical task-network planning. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pp. 249-254 Chicago, IL.

Erol, K., Nau, D., & Subrahmanian, V. S. (1995). Decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76 (1-2), 75–88.

Estlin, T. A., & Mooney, R. J. (1997). Learning to improve both efficiency and quality of planning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pp. 1227-1233 Nagoya, Japan.