Quantification in generative refinement planning

  • Andrew Burgess
  • Sam Essex
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1348)


This paper brings together a collection of new ideas from generative refinement planning with some more well established results from theorem proving. We add full quantification to a generative refinement planning framework, not by expanding to a universal base [9], but by Skolemizing. We apply our results to causal link planning which leads to a new conflict resolution strategy, a notion called weakening the label.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Chapman. Planning for conjunctive goals. In Artificial Intelligence, number 32, pages 333–377. 1987.Google Scholar
  2. 2.
    R.E. Fikes and N.J. Nilsson. Strips: a new approach to the application of theorem proving to problem solving. In Artificial Intelligence, volume 2, pages 189–208. 1971.Google Scholar
  3. 3.
    D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In 9th Nat. Conf. on A.I., pages 634–639, July 1991.Google Scholar
  4. 4.
    D. McDermott. Regression planning. International Journal of Intelligent Systems, 6:357–416, 1991.Google Scholar
  5. 5.
    E.P.D. Pednault. Formulating multiagent, dynamic-world problems in the classical planning framework. In M.P. Georgeff and A.L. Lansky, editors, Reasoning about actions and plans: proceedings of the 1986 workshop, pages 47–82, Los Altos, California, 1986. Morgan Kaufmann.Google Scholar
  6. 6.
    E.P.D. Pednault. Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4(4):356–372, 1988.Google Scholar
  7. 7.
    E.P.D. Pednault. Adl: Exploring the middle ground between strips and the situation calculus. In 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 324–332, 1989.Google Scholar
  8. 8.
    E.P.D. Pednault. Generalizing nonlinear planning to handle complex goals and actions with context-dependent effects. In J. Mylopoulos and R. Reiter, editors, 12th Int. Conf. Artificial Intelligence, volume 1, 1991.Google Scholar
  9. 9.
    J.S. Penberthy and D.S. Weld. Ucpop: A sound, complete, partial order planner for adl. In 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 103–114, 1992. Available via FTP from /pub/ai at cs.washington.edu.Google Scholar
  10. 10.
    D. Weld. An introduction to least-commitment planning. AI Magazine, 1994. Available via FTP from pub/ai/ at cs.washington.edu.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Andrew Burgess
    • 1
  • Sam Essex
    • 1
  1. 1.University of EssexColchesterUK

Personalised recommendations