Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Chapman. Planning for conjunctive goals. In Artificial Intelligence, number 32, pages 333–377. 1987.
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.
D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In 9th Nat. Conf. on A.I., pages 634–639, July 1991.
D. McDermott. Regression planning. International Journal of Intelligent Systems, 6:357–416, 1991.
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.
E.P.D. Pednault. Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4(4):356–372, 1988.
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.
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.
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.
D. Weld. An introduction to least-commitment planning. AI Magazine, 1994. Available via FTP from pub/ai/ at cs.washington.edu.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burgess, A., Essex, S. (1997). Quantification in generative refinement planning. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_78
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63912-1
Online ISBN: 978-3-540-69665-0
eBook Packages: Springer Book Archive