Skip to main content

A weakest precondition semantics for conditional planning

  • Conference paper
  • First Online:
Topics in Artificial Intelligence (AI*IA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 992))

Included in the following conference series:

  • 129 Accesses

Abstract

In this paper we show an approach to conditional planning which is based on a particular three valued logic. Assignments and conditional formulae (built by means of the alternate operator as introduced in [7]) are used to represent uncertain situations. A model for actions in a conditional framework is defined by giving an execution function, which returns the updated situation after the execution, and an executability predicate. We also define a weakest precondition semantics in order to determine the least alternative situation in which a plan is executable and, after the execution, a required formula holds. The tools we introduced allow us to compile a plan in a macroaction, which is an abstraction of a plan, neglecting its internal decomposition. It is possible to prove that the use of macroactions is correct in a more complex plan.

This work has been partially supported by Progetto Speciale “Pianificazione Automatica” under contract n. 93.006.27.CT07 of Italian National Research Council — C.N.R. and by 40% project “Algoritmi, Modelli di Calcolo e Strutture Informative” of M.U.R.S.T.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.J. Schoppers, ”Universal Plans for Reactive Robots in Unpredictable Domains”, Proc. IJCAI-87, 1039 (1987)

    Google Scholar 

  2. M.A.Peot, D.E.Smith, ”Conditional Nonlinear Planning”, Proc.of the 1st Int. Conf. on A.I.Planning Systems, AIPS92, J.Hendler Ed., Morgan Kaufmann, 189 (1992)

    Google Scholar 

  3. D.H.D. Warren, ”Generating Conditional Plans and Programs” Proc. of AISB-76 Summer Conference, Edinburgh, 277 (1976)

    Google Scholar 

  4. G.Brewka, J.Hertzberg: How To Do Things with Worlds: ”On Formalizing Actions and Plans”, Tasso-report n.11, GMD, (1990)

    Google Scholar 

  5. M.L.Ginsberg, D.E.Smith, ”Reasoning About Action I: A Possible Worlds Approach” Art.Int., n. 35, 165 (1988)

    Google Scholar 

  6. R.G. Sani, S. Steel ”Recursive Plans”, in Proceedings of the 1st European Workshop on Planning EWSP 1991, Sankt Augustin, Germany, Lecture Notes in Artificial Intelligence 522, Springer Verlag, 53 (1991)

    Google Scholar 

  7. A. Milani ”A Representation for Multiple Situations in Conditional Planning”, in Current Trends in AI Planning, EWSP'93 — 2nd European Workshop on Planning, IOS Press (1994)

    Google Scholar 

  8. G. Antognoni, A.Milani, S.Marcugini ”Extending a Conditional Planning Model with Multiple Situations Management”, Tech.Rep. n.12 January 1993, Dipartimento di Matematica, Università di Perugia, Perugia, Italy (1993)

    Google Scholar 

  9. G. Antognoni, ”Pianificazione di Azioni con Effetti Alternativi: un Modello di Rappresentazione”, Tesi di Laurea, Dipartimento di Matematica, Università di Perugia, Perugia, Italy (1992)

    Google Scholar 

  10. R.E.Fikes, N.J.Nillson ”STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving”, Artific. Intell. n.2, 189 (1971)

    Google Scholar 

  11. D.Chapman ”Planning for conjunctive goal”, Artific. Intell. n.32 (1987)

    Google Scholar 

  12. S.Hanks, ”Pratical Temporal Projection”, Proc. AAAI-90, (1990)

    Google Scholar 

  13. V.Liftschiz ”On the semantics of STRIPS”, Proc. 1986 Workshop Reasoning About Actions and Plans, Timberline, OR, Morgan Kaufmann, 1, (1987)

    Google Scholar 

  14. L.P.Kaelbling, ”An Architecture for Intelligent Reactive Systems”, Proc. 1986 Workshop Reasoning About Actions and Plans, Timberline, OR, Morgan Kaufmann, 1, (1987)

    Google Scholar 

  15. D.H.D. Warren, ”Warplan: A System for Generating Plans” in Readings in Planning; J. Allen, J.Hendler, A. Tate ed., Morgan Kaufmann (1990)

    Google Scholar 

  16. M.Winslett, ”Reasoning about Action Using a Possible Models Approach”, Proc. AAAI-88, 89 (1988)

    Google Scholar 

  17. T.Bylander, ”Complexity Results for Planning”, Proc. of IJCAI-91, 274 (1991)

    Google Scholar 

  18. L.Morgensten, ”Knowledge Preconditions for Actions and Plans” in Proceeding of IJCAI-87 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marco Gori Giovanni Soda

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baioletti, M., Marcugini, S., Milani, A. (1995). A weakest precondition semantics for conditional planning. In: Gori, M., Soda, G. (eds) Topics in Artificial Intelligence. AI*IA 1995. Lecture Notes in Computer Science, vol 992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60437-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-60437-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60437-2

  • Online ISBN: 978-3-540-47468-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics