Skip to main content

An Application of Global Abduction to an Information Agent Which Modifies a Plan Upon Failure – Preliminary Report

  • Conference paper
  • First Online:
Computational Logic in Multi-Agent Systems (CLIMA 2004)

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

Included in the following conference series:

Abstract

This paper proposes an implementation of an information agent in a new form of abductive logic programming called global abduction [11]. We consider an information agent which performs not only information gathering, but also actions which update the outside world. However, since the success of the actions is not guaranteed, the agent might encounter a failure of some action. In this case, the agent needs to modify an alternative plan with consideration to the side-effects caused by the already-executed actions. In this paper, we solve the problem of such plan modification by using global abduction. Global abduction is a new form of abduction whose abducibles can be referred to in any search path once abduced. This mechanism is used to propagate information about already-executed actions so that we can modify an alternative plan to accommodate side-effects caused by the already-executed actions.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fitting, M.C.: A Kripke/Kleene Semantics for Logic Programs. Journal of Logic Programming 2, 295–312 (1985)

    Article  MathSciNet  Google Scholar 

  2. Golden, K., Etzioni, O., Weld, D.: Omnipotence Without Omniscience: Efficient Sensor Management for Planning. In: Proc. of AAAI 1994, pp. 1048–1054 (1994)

    Google Scholar 

  3. Levesque, H., Reiter, R., Lesperance, Y., Lin, F., Scherl, R.: GOLOG: A Logic Programming Language for Dynamic Domains. Journal of Logic Programming 31, 59–84 (1997)

    Article  MathSciNet  Google Scholar 

  4. Hayashi, H., Cho, K., Ohsuga, A.: Mobile Agents and Logic Programming. In: Proc. of Mobile Agents 2002, pp. 32–46 (2002)

    Google Scholar 

  5. Hayashi, H., Cho, K., Ohsuga, A.: A New HTN Planning Framework for Agents in Dynamic Environments. In: Dix, J., Leite, J. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3259, pp. 108–133. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Kakas, A.C., Kowalski, R., Toni, F.: The Role of Abduction in Logic Programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

  7. Knoblock, C.A.: Planning, Executing, Sensing, and Replanning for Information Gathering. In: Proc. of IJCAI 1995, pp. 1686–1693 (1995)

    Google Scholar 

  8. Kowalski, R.A., Sadri, F.: From Logic Programming towards Multi-agent Systems. Annals of Mathematics and Artificial Intelligence 25, 391–419 (1999)

    Article  MathSciNet  Google Scholar 

  9. Nebel, B., Koehler, J.: Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis. Artif. Intell. 76(1-2), 427–454 (1995)

    Article  Google Scholar 

  10. Przymusinski, T.: The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundamenta Informaticae 13(4), 445–463 (1990)

    MathSciNet  MATH  Google Scholar 

  11. Satoh, K.: All’s Well that Ends Well – A Proposal of Global Abduction –. In: Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning, pp. 360–367 (2004)

    Google Scholar 

  12. Shanahan, M.P.: Reinventing Shakey. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 233–253. Kluwer Academic, Dordrecht (2000)

    Chapter  Google Scholar 

  13. Thielscher, M.: The Qualification Problem: A Solution to the Problem of Anomalous Models. Artificial Intelligence 131(1–2), 1–37 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Satoh, K. (2005). An Application of Global Abduction to an Information Agent Which Modifies a Plan Upon Failure – Preliminary Report. In: Leite, J., Torroni, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2004. Lecture Notes in Computer Science(), vol 3487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533092_13

Download citation

  • DOI: https://doi.org/10.1007/11533092_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28060-6

  • Online ISBN: 978-3-540-31857-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics