Etzioni, O. (1993). Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62 (2), 255–302.

Etzioni, O., & Weld, D. S. (1994). A softbot-based interface to the Internet. Communications of the ACM, 37(7).

Fikes, R. E., & Nilsson, N. J. (1971). STRIPS: A new approa to the application of theorem proving to problem solving. Artificial Intelligence, 2 (3/4), 189–208.

Forgy, C. L. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17–37.

Foulser, D. E., Li, M., & Yang, Q. (1992). Theory and algorithms for plan merging. Artificial Intelligence, 57 (2-3), 143-182.

Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificicial Intelligence Research, 9, 367-421.

Gerevini, A., & Schubert, L. (1998). Inferring state constraints for domain-independent planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 905–912 Madison, WI.

Glover, F. (1989). Tabu sear–Part I. ORSA Journal on Computing, 1 (3), 190–206. Gomes, C. P., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence Madison, WI.

Gupta, N., & Nau, D. S. (1992). On the complexity of blocks-world planning. Artificial Intelligence, 56(2-3), 223-254.

Hanks, S., & Weld, D. S. (1995). A domain-independent algorithm for plan adaptation.

Journal of Artificicial Intelligence Research, 2, 319-360.

Johnson, D. S. (1990). Local optimization and the traveling salesman problem. In Paterson, M. S. (Ed.), Automata, Languages and Programming: Proc. of the 17th International Colloquium, pp. 446-461. Springer, New York.

Kambhampati, S. (1992). A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55 (2-3), 193–258.

Kambhampati, S., Knoblock, C. A., & Yang, Q. (1995).  Planning as refinement search:
A unified framework for evaluating the design tradeoffs in partial order planning.

Artificial Intelligence, 76 (1-2), 167-238.

Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Neumann, B. (Ed.), Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359–363 Vienna, Austria. John Wiley & Sons.