Skip to main content

Complex Plans in the Fluent Calculus

  • Chapter
Intellectics and Computational Logic

Part of the book series: Applied Logic Series ((APLS,volume 19))

Abstract

Imagine an autonomous agent performing a task in the real world. Its performance is based on an internal plan. From a low level point of view, the world is its own representation and the actions of the aforementioned plan are simple commands controlling the effectors of the agent. At a higher level of abstraction, the world is internally represented by states and (primitive) actions are transformations on the space of states. In this article we do not want to discuss how actions on the higher level lead to commands on the lower level or whether the abstract level is needed or not, although these are very interesting and active open research problems. We also do not want to deal with another burning question of how the agent got hold of its plan. The plan may be given to it by a programmer, it may have (semi-)automatically generated the plan from the initial state, the goal state and the descriptions of the primitive actions it is able to perform or it may have learned it from examples. For the purpose of this article we just assume that a plan at the abstract level is given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bibel, W. (1986). A deductive solution for plan generation. New Generation Computing, 4: 115–132.

    Article  Google Scholar 

  • Biundo, S. and Stephan, W. (1993). A new logical framwork for deductive planning. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 32–38.

    Google Scholar 

  • Clark, K. L. (1978). Negation as Failure. In Gallaire, H. and Minker, J., editors, Workshop Logic and Data Bases,pages 293–322. Plenum Press.

    Google Scholar 

  • Giacomo, G. D., Reiter, R., and Soutchanski, M. (1998). Execution monitoring of high-level robot programs. In Cohn, A. G., Schubert, L., and Shapiro, S. C., editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR’98), pages 453–464. Morgan Kaufmann Publishers, Inc., San Francisco.

    Google Scholar 

  • Große, G., Hölldobler, S., and Schneeberger, J. (1996). Linear deductive planning. Journal of Logic and Computation, 6 (2): 233–262.

    Article  Google Scholar 

  • Hölldobler, S. and Schneeberger, J. (1990). A new deductive approach to planning. New Generation Computing, 8:225–244. A short version appeared in the Proceedings of the German Workshop on Artificial Intelligence, Informatik Fachberichte 216, pages 63–73, 1989.

    Article  Google Scholar 

  • Hölldobler, S. and Thielscher, M. (1995). Computing change and specificity with equational logic programs. Annals of Mathematics and Artificial Intelligence, 14: 99–133.

    Article  Google Scholar 

  • Kennedy, C. M. (1998). A conceptual foundation for autonomous learning in unforeseen situations. In IEEE International Symposium on Intelligent Control (ISIC/CIRA/ISAS’98),Gaithersburg, Maryland.

    Google Scholar 

  • Levesque, H., Reiter, R., Lespérance, Y., Lin, F., and Scherl, R. (1997). Golog: A logic programming language for dynamic domains. Journal of Logic Programming, Special Issue `Action and Change’.

    Google Scholar 

  • Levesque, H. J. (1996). What is planning in the presence of sensing? Technical report, Department of Computer Science, University of Toronto, Canada.

    Google Scholar 

  • Manna, Z. and Waldinger, R. (1987). How to clear a block: A theory of plans. Journal of Automated Reasoning, 4 (3): 343–377.

    Google Scholar 

  • McCarthy, J. (1963). Situations and actions and causal laws. Stanford Artificial Intelligence Project: Memo 2.

    Google Scholar 

  • McCarthy, J. and Hayes, P. J. (1969). Some philosophical problems from the standpoint of Artificial Intelligence. In Meltzer, B. and Michie, D., editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press.

    Google Scholar 

  • Reiter, R. (1991). The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result vor goal regression. In Lifschitz, V., editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 359–380. Academic Press, San Diego, CA.

    Chapter  Google Scholar 

  • Stephan, W. and Biundo, S. (1995). Deduction-based refinement planning. Technical Report RR-95–13, Germen Research Center for Artificial Intelligence (DFKI).

    Google Scholar 

  • Störr, H.-P. (1997). Bedingte und Rekursive Aktionen im Fluent—Kalkül. Master’s thesis, Dresden University of Technology. (in German).

    Google Scholar 

  • White, G. (1998). Golog and linear logic programming. Technical report, Dept. Computer Science, Queen Mary and Westfield College, University of London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Hölldobler, S., Störr, HP. (2000). Complex Plans in the Fluent Calculus. In: Hölldobler, S. (eds) Intellectics and Computational Logic. Applied Logic Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9383-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9383-0_13

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5438-8

  • Online ISBN: 978-94-015-9383-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics