Skip to main content

On the Implementation of Global Abduction

  • Conference paper

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

Abstract

Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. This paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. The construction gives rise a discussion of important issues of the semantics and pragmatics of Global Abduction, leading to proposals for a specific procedural semantics and architecture that seem well suited for real-time applications.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdennadher, S., Christiansen, H.: An experimental CLP platform for integrity constraints and abduction. In: Proceedings of FQAS2000, Flexible Query Answering Systems: Advances in Soft Computing series, pp. 141–152. Physica-Verlag, Heidelberg (2000)

    Google Scholar 

  2. Abdennadher, S., Schütz, H.: Chr ∀ : A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1–14. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E.: The CHR-based implementation of a system for generation and confirmation of hypotheses. In: Wolf, A., Frühwirth, T.W., Meister, M. (eds.) W(C)LP, vol. 2005-01 of Ulmer Informatik-Berichte, pp. 111–122. Universität Ulm, Germany (2005)

    Google Scholar 

  4. Betz, H., Frühwirth, T.W.: A linear-logic semantics for constraint handling rules. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 137–151. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Christiansen, H.: Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming 37(1-3), 213–254 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Christiansen, H.: Abductive language interpretation as bottom-up deduction. In: Wintner, S. (ed.) Natural Language Understanding and Logic Programming, Roskilde, Denmark, July 28. Datalogiske Skrifter, vol. 92, pp. 33–47 (2002)

    Google Scholar 

  7. Christiansen, H.: CHR Grammars. Int’l Journal on Theory and Practice of Logic Programming 5(4-5), 467–501 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Christiansen, H., Dahl, V.: Assumptions and abduction in Prolog. In: Albert, E., Hanus, M., Hofstedt, P., van Roy, P. (eds.) 3rd International Workshop on Multiparadigm Constraint Programming Languages, MultiCPL’04, at the 20th International Conference on Logic Programming, ICLP’04, Saint-Malo, France, 6-10 September, pp. 87–101 (2004)

    Google Scholar 

  9. Christiansen, H., Dahl, V.: HYPROLOG: A new logic programming language with assumptions and abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 159–173. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Christiansen, H., Martinenghi, D.: Symbolic constraints for meta-logic programming. Applied Artificial Intelligence 14(4), 345–367 (2000)

    Article  Google Scholar 

  11. Costantini, S., Tocchio, A.: A logic programming language for multi-agent systems. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 1–13. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Dahl, V., Tarau, P., Li, R.: Assumption grammars for processing natural language. In: ICLP, pp. 256–270 (1997)

    Google Scholar 

  13. Duck, G.J., Stuckey, P.J., García de la Banda, M.J., Holzbaur, C.: The refined operational semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)

    Google Scholar 

  14. Fitting, M.: A deterministic prolog fixpoint semantics. J. Log. Program. 2(2), 111–118 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Frühwirth, T.: Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming 37(1–3), 95–138 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Frühwirth, T.W., Holzbaur, C.: Source-to-source transformation for a class of expressive rules. In: Buccafurri, F. (ed.) APPIA-GULP-PRODE, pp. 386–397 (2003)

    Google Scholar 

  17. Hayashi, H.: Computing with Changing Logic programs. PhD thesis, Imperial College of Science, Technology and Medicine, University of London (2001)

    Google Scholar 

  18. Inoue, K., Iwanuma, K.: Speculative computation through consequence-finding in multi-agent environments. Ann. Math. Artif. Intell. 42(1-3), 255–291 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kakas, A.C., Kowalski, R.A., 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 

  20. Leite, J., Soares, L.: Enhancing a multi-agent system with evolving logic programs. In: Inoue, K., Satoh, K., Toni, F. (eds.) Seventh Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VII) (to appear, 2006)

    Google Scholar 

  21. Przymusinski, T.C.: The well-founded semantics coincides with the three-valued stable semantics. Fundam. Inform. 13(4), 445–463 (1990)

    MathSciNet  MATH  Google Scholar 

  22. Satoh, K.: “All’s well that ends well” - a proposal of global abduction. In: Delgrande, J.P., Schaub, T. (eds.) NMR, pp. 360–367 (2004)

    Google Scholar 

  23. Satoh, K.: An application of global abduction to an information agent which modifies a plan upon failure - preliminary report. In: Leite, J.A., Torroni, P. (eds.) Computational Logic in Multi-Agent Systems. LNCS (LNAI), vol. 3487, pp. 213–229. Springer, Heidelberg (2005)

    Google Scholar 

  24. Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by abduction under incomplete communication environments. In: ICMAS, pp. 263–270. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  25. Satoh, K., Yamamoto, K.: Speculative computation with multi-agent belief revision. In: AAMAS, pp. 897–904. ACM Press, New York (2002)

    Chapter  Google Scholar 

  26. Seitz, C., Bauer, B., Berger, M.: Multi agent systems using Constraint Handling Rules for problem solving. In: Arabnia, H.R., Mun, Y. (eds.) IC-AI, pp. 295–301. CSREA Press (2002)

    Google Scholar 

  27. Swedish Institute of Computer Science. SICStus Prolog user’s manual, Version 3.12 (2006), most recent version available at http://www.sics.se/isl/sicstuswww/site/documentation.html

  28. Tarau, P., Dahl, V., Fall, A.: Backtrackable state with linear assumptions, continuations and hidden accumulator grammars. In: Lloyd, J.W. (ed.) Logic Programming, Proceedings of the 1995 International Symposium, p. 642. MIT Press, Cambridge (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Katsumi Inoue Ken Satoh Francesca Toni

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Christiansen, H. (2007). On the Implementation of Global Abduction. In: Inoue, K., Satoh, K., Toni, F. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2006. Lecture Notes in Computer Science(), vol 4371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69619-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69619-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69619-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics