References

[1]. A.V. Aho, J.E. Hopcroft and J.D. Ullman. In: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1976).

[2]. C. Bäckström and I. Klein, Planning in polynomial time: the sas-pubs class. Comput. Intell. 7 (1991).

[3]. T. Bylander, Complexity results for planning. In: Proceedings IJCAI-91 (1991).

[4]. T. Bylander, Complexity results for extended planning. In: Proceedings First International Conference on AI Planning Systems (1992).

[5]. D. Chapman, Planning for conjunctive goals. Artif. Intell. 32 (1987), pp. 333–379.

[6]. E. Charniak and D. McDermott. In: Introduction to Artificial Intelligence, Addison-Wesley, Reading, MA (1985).

[7]. S.V. Chenoweth, On the NP-hardness of blocks world. In: Proceedings AAAI-91 (1991), pp. 623–628.

[8]. T.L. Dean and M. Boddy, Reasoning about partially ordered events. Artif. Intell. 36 (1988), pp. 375–399. Abstract | PDF (1081 K) | View Record in Scopus | Cited By in Scopus (21)

[9]. K. Erol, J.A. Hendler and D.S. Nau, Complexity results for hierarchical task-network planning (Submitted).

[10]. K. Erol, D.S. Nau and V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning. In: Technical Report CS-TR-2797, UMIACS-TR-91-154, SRC-TR-91-96, Computer Science Department and Institute for Systems Research, University of Maryland, College Park, MD (1991).

[11]. K. Erol, D.S. Nau and V.S. Subrahmanian, When is planning decidable?. In: Proceedings First International Conference on A1 Planning Systems (1992), pp. 222–227. View Record in Scopus | Cited By in Scopus (3)

[12]. K. Erol, D.S. Nau and J.A. Hendler, Toward a general framework for hierarchical task-network planning. In: Proceedings AAAI Spring Symposium (1993).

[13]. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2 3/4 (1971), pp. 189–208. Abstract | PDF (1580 K) | View Record in Scopus | Cited By in Scopus (554)

[14]. M.R. Garey and D.S. Johnson. In: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York (1979).

[15]. R.L. Graham, D.E. Knuth and O. Patashnik. In: Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, Reading, MA (1989).

[16]. N. Gupta and D.S. Nau, Complexity results for blocks-world planning. In: Proceedings AAAI-9I (1991) Honorable mention for the Best Paper Award .

[17]. N. Gupta and D.S. Nau, On the complexity of blocks-world planning. Artif. Intell. 56 2–3 (1992), pp. 223–254. Abstract | PDF (1611 K) | View Record in Scopus | Cited By in Scopus (20)

[18]. R.E. Korf, Planning as search: a quantitative approach. Artif. Intell. 33 1 (1987), pp. 65–88. Abstract | PDF (1326 K) | View Record in Scopus | Cited By in Scopus (64)

[19]. V. Lifschitz, On the semantics of STRIPS. In: J.F. Allen, J.A. Hendler and A. Tate, Editors, Readings in Planning, Morgan Kaufmann, San Mateo, CA (1990), pp. 523–530.

[20]. D. McAllester and D. Rosenblitt, Systematic nonlinear planning. In: Proceedings AAAI-91 (1991), pp. 634–639.

[21]. D. McDermott, Regression planning. Int. J. Intell. Syst. 6 (1991), pp. 357–416. View Record in Scopus | Cited By in Scopus (5)

[22]. S. Minton, J. Bresna and M. Drummond, Commitment strategies in planning. In: Proceedings IJCAI-91 (1991).

[23]. D.S. Nau, On the complexity of possible truth. In: Proceedings AAAI Spring Symposium (1993).

[24]. N.J. Nilsson. In: Principles of Artificial Intelligence, Tioga, Palo Alto (1980).

[25]. E.P.D. Pednault, Synthesizing plans that contain actions with context-dependent effects. Comput. Intell. 4 (1988), pp. 356–372.

[26]. M.A. Peot, Conditional nonlinear planning. In: Proceedings First International Conference on AI Planning Systems (1992), pp. 189–197. View Record in Scopus | Cited By in Scopus (48)

[27]. E.D. Sacerdoti, Planning in a hierarchy of abstraction spaces. Artif. Intell. 5 (1974), pp. 115–135. Abstract | PDF (1078 K) | View Record in Scopus | Cited By in Scopus (123)

[28]. E.D. Sacerdoti, The nonlinear nature of plans. In: J.F. Allen, J.A. Hendler and A. Tate, Editors, Readings in Planning, Morgan Kaufmann, San Mateo, CA (1990), pp. 162–170.
E.D. Sacerdoti Originally appeared in: . In: Proceedings IJCAI-75 (1975), pp. 206–214.

[29]. J. Shoenfield. In: Mathematical Logic, Academic Press, New York (1967).

[30]. V.S. Subrahmanian and C. Zaniolo, Database updates and AI planning domains. In: Technical Report CS-TR-3173, UMIACS-TR-93-118, Computer Science Department, University of Maryland, College Park, MD (1993).

[31]. A. Tate, J.A. Hendler and M. Drummond, A review of AI planning techniques. In: J.F. Allen, J.A. Hendler and A. Tate, Editors, Readings in Planning, Morgan Kaufmann, San Mateo, CA (1990), pp. 26–49.

[32]. A. Tate, Generating project networks. In: Proceedings IJCAI-77 (1977).

[33]. D.E. Wilkins, Domain-independent planning: representation and plan generation. In: J.F. Allen, J.A. Hendler and A. Tate, Editors, Readings in Planning, Morgan Kaufmann, San Mateo, CA (1990), pp. 319–335.
D.E. Wilkins Originally appeared in: . Artif. Intell. 22 3 (1984), pp. 269–301. Abstract | PDF (1957 K) | View Record in Scopus | Cited By in Scopus (26)

[34]. Q. Yang, D.S. Nau and J.A. Hendler, Optimization of multiple-goal plans with limited interaction. In: Proceedings DARPA Workshop on Innovative Approaches to Planning, Scheduling and Control (1990).

[35]. Q. Yang, D.S. Nau and J.A. Hendler, Merging separately generated plans with restricted interactions. Comput. Intell. 8 2 (1992), pp. 648–676.