Skip to main content

Reasoning about Actions with Loops

  • Conference paper
  • 2745 Accesses

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

Abstract

Plans with loops (or loop-plans) are more general and compact than classical sequential plans, and gaining increasing attention in AI. While many existing approaches focus on algorithmic issues, few work has been devoted to the semantical foundations of planning with loops. In this paper we develop a tailored action language \(\mathcal{A}_K^L\) for handling domains with loop-plans and argue that it posses a “better” semantics than existing work and could serve as a clean, solid semantical foundation for reasoning about actions with loops.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lespérance, Y., Levesque, H.J., Lin, F., Scherl, R.B.: Ability and knowing how in the situation calculus. Studia Logica 66(1), 165–186 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Sardina, S., Giacomo, G.D., Lespèrance, Y., Levesque, H.: On the semantics of deliberation in indigolog - from theory to implementation. Annals of Mathematics and Artificial Intelligence 41(2-4), 259–299 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Son, T.C., Baral, C.: Formalizing sensing actions: A transition function based approach. Artificial Intelligence 125(1-2), 19–91 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Amir, E.: Planning with nondeterministic actions and sensing. In: AAAI 2002 Workshop on Cognitive Robotics (2002)

    Google Scholar 

  5. Lobo, J., Mendez, G., Taylor, S.R.: Knowledge and the action description language \(\mathcal{A}\). Theory and Practice of Logic Programming 1(2), 129–184 (2001)

    MATH  MathSciNet  Google Scholar 

  6. Levesque, H.J.: Planning with loops. In: Proceedings of 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 509–515 (2005)

    Google Scholar 

  7. Srivastava, S., Immerman, N., Zilberstein, S.: Applicability conditions for plans with loops: Computability results and algorithms. Artificial Intelligence 191, 1–19 (2012)

    Article  MathSciNet  Google Scholar 

  8. Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1), 35–84 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Winner, E., Veloso, M.: LoopDISTILL: Learning domain-specific planners from example plans. In: Proceedings of ICAPS 2007 Workshop on AI Planning and Learning (2007)

    Google Scholar 

  10. Lifschitz, V.: On the semantics of strips. In: Georgeff, M.P., Lansky, A. (eds.) Reasoning about Actions and Plans. Morgan Kaufmann, San Mateo (1987)

    Google Scholar 

  11. Fikes, R.E., Nilsson, N.J.: Strips, a retrospective. Artificial Intelligence 59(1-2), 227–232 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

He, J., Shen, Y., Zhao, X. (2014). Reasoning about Actions with Loops. In: Likas, A., Blekas, K., Kalles, D. (eds) Artificial Intelligence: Methods and Applications. SETN 2014. Lecture Notes in Computer Science(), vol 8445. Springer, Cham. https://doi.org/10.1007/978-3-319-07064-3_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07064-3_43

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07063-6

  • Online ISBN: 978-3-319-07064-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics