References

• J. F. Allen, L.K. Schubert, G. M. Ferguson, P. A. Heeman, C. H. Hwant, T. Kato, M. Light, N. G. Margin, B. W. Miller, M. Poesio, and B. R. Traum. The TRAINS project: A case study in building a conversational planning agent. Experimental and Theoretical Artificial Intelligence, 7:7-48, 1995.

• David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32(3):333-378, 1987.

• Ken Currie and Austin Tate. O-plan: The open planning architecture. Artificial Intelligence, 52:49-86, 1991.

• Oren Etzioni, Steve Hanks, Daniel Weld, Denise Draper, Neil Lesh, and Mike Williamson. An approach to planning with incomplete information. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pages 115-125, 1992.

• Alfonso Gerevini. Personal communication, 1997.

• Alfonso Gerevini and Lenhart Schubert. Accelerating partial-order planners: Some techniques for effective search control and pruning. Journal of Artificial Intelligence Research, 5:95-137, 1996.

• David Joslin. Passive and Active Decision Postponement in Plan Generation. PhD thesis, Intelligent Systems Program, University of Pittsburgh, 1996.

• David Joslin and Martha E. Pollack. Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI), pages 1004-1009, Seattle, WA, 1994.

• David Joslin and Martha E. Pollack. Is 'early commitment' in plan generation ever a good idea? In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pages 1188-1193, Portland, OR, 1996.

• Subbarao Kambhampati, Craig A. Knoblock, and Qiang Yang. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence, 76(1-2):167-238, 1995.

• Hans Kamp. A theory of truth and semantic interpretation. In J. A. G. Groenendijk, T. M. V. Janssen, and M. B. J. Stokhof, editors, Formal Methods in the Study of Language, pages 277-322. Mathematisch Centrum, Amsterdam, Netherlands, 1981.

• Vipin Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1):32-44, 1992.

• David McAllester and David Rosenblitt. Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence, pages 634-639, Anaheim, CA, 1991.

• Edwin P. D. Pednault. Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4(4):356-372, 1988.

• J. Scott Penberthy and Daniel Weld. UCPOP: A sound, complete, partial order planner for ADL. In Proceedings of the Third International Conference on Knowledge Representation and Reasoning, pages 103-114, Cambridge, MA, 1992.

• Mark Peot and David E. Smith. Conditional nonlinear planning. In Proceedings of the First International Conference on AI Planning Systems (AIPS-92), pages 189-197, College Park, MD, 1992.

• Mark Peot and David E. Smith. Threat-removal strategies for partial-order planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 492-499, Washington, D.C., 1993.

• Martha E. Pollack and Marc Ringuette. Introducing the Tileworld: Experimentally evaluating agent architectures. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 183-189, Boston, MA, 1990.

• Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, NJ, 1995.

• Stuart J. Russell. Efficient memory-bounded search algorithms. In Proceedings of the Tenth European Conference on Artificial Intelligence, pages 1-5, 1992.

• David E. Smith and Mark A. Peot. A note on the DMIN strategy. Unpublished manuscript., 1994.

• Raghavan Srinivasan and Adele E. Howe. Comparison of methods for improving search efficiency in a partial-order planner. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1620-1626, 1995.

• A. Tate, B. Drabble, and J. Dalton. Reasoning with constraints within o-plan2. Technical Report ARPA-RL/O-Plan2/TP/6 V. 1, AIAI, Edinburgh, 1994.

• E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.

• Reiko Tsuneto, Kutluhan Erol, James Hendler, and Dana Nau. Commitment strategies in hierarchical task network planning. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pages 526-542, Portland, OR, 1996.

• Daniel S. Weld. An introduction to least commitment planning. AI Magazine, 15(4):27-61, 1994.

• David E. Wilkins. Practical Planning: Extending the Classical AI Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.

• David E. Wilkins and Robert V. Desimone. Applying an AI planner to military operations planning. In Mark Fox and Monte Zweben, editors, Intelligent Scheduling, pages 685-708. Morgan Kaufmann Publishers, San Mateo, CA, 1994.

• Mike Williamson and Steve Hanks. Flaw selection strategies for value-directed planning. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, pages 237-244, 1996.