Recursive plans

  • G. R. Ghassem-Sani
  • S. W. D. Steel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 522)


It is generally agreed that a planner should be able to reason with uncertain and iterative behaviours because many actions in real world have such behaviours. Some of earlier non-linear planners have approached these issues, nevertheless, the way that they handle the problem has not been logically derived. We introduce a new type of non-linear plans, Recursive Plans, which can be used to solve a class of conditional and recursive problems. The idea, which has been implemented, is based on mathematical induction.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Boyer, R. S. and Moore, J. S. (1979) ACM monograph series, A Computational Logic, Academic Press, INC. LondonMATHGoogle Scholar
  2. Bratko, I. (1987) Prolog Programming for Artificial Intelligence, Academic Press, INC. LondonGoogle Scholar
  3. Drummond, M. (1986) A representation of action and belief for automatic planning systems, in: (Georgeff, M. and Lansky, A.), Morgan KauffmanGoogle Scholar
  4. Ghassem-Sani, G. R. (1988) Iterative actions in non-linear planners, M.Sc. Thesis, Department of Computer Science, University of EssexGoogle Scholar
  5. Ghassem-Sani, G. R. and Steel, S. W. D. (forthcoming) Recursive Plans, Internal Report, University of EssexGoogle Scholar
  6. Huet, G. P. (1974) A unification algorithm for typed lambda-calculus, note de travial A 055, Institute de Recherche d’Informatique et d’AutomatiqueGoogle Scholar
  7. Manna, Z. and Waldinger, R. (1980) A deductive approach to programme synthesis, ACM Transactions on Programming Languages and Systems, 2(1), PP. 90–121MATHCrossRefGoogle Scholar
  8. Manna, Z. and Waldinger, R. (1987) How to clear a block: A Theory of plans, Journal of Automated Reasoning, Vol. 3, PP. 343–377MATHCrossRefMathSciNetGoogle Scholar
  9. McCarthy J. (1963) Situations, actions, and causal laws, Technical report, Stanford university, Stanford, Calf.Google Scholar
  10. Robinson, J. A. (1965) A machine oriented logic based on the resolution principle, J. ACM 12, No 1, PP. 23–41MATHCrossRefGoogle Scholar
  11. Sacerdoti, E. D. (1977) A Structure for Plans and Behaviour, American Elsevier North-Holland, New YorkGoogle Scholar
  12. Steel, S. W. D. (1988) An iterative construct for non-linear precedence planners, Proc. Seventh Biennial Conference of the Canadian Society for the Computational Study of Intelligence, PP. 227–233Google Scholar
  13. Warren, D. H. D. (1976) Generating Conditional Plans and Programmes, In Proceedings of the AISB summer conference, PP. 344–354Google Scholar
  14. Wilkins, D. E. (1984) Domain-independent Planning: Representation and Plan Generation, Artificial Intelligence 22(3), PP. 269–301CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • G. R. Ghassem-Sani
    • 1
  • S. W. D. Steel
    • 1
  1. 1.Computer Science DepartmentUniversity of EssexColchester

Personalised recommendations