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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Christiansen, H.: Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming 37(1-3), 213–254 (1998)
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)
Christiansen, H.: CHR Grammars. Int’l Journal on Theory and Practice of Logic Programming 5(4-5), 467–501 (2005)
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)
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)
Christiansen, H., Martinenghi, D.: Symbolic constraints for meta-logic programming. Applied Artificial Intelligence 14(4), 345–367 (2000)
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)
Dahl, V., Tarau, P., Li, R.: Assumption grammars for processing natural language. In: ICLP, pp. 256–270 (1997)
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)
Fitting, M.: A deterministic prolog fixpoint semantics. J. Log. Program. 2(2), 111–118 (1985)
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)
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)
Hayashi, H.: Computing with Changing Logic programs. PhD thesis, Imperial College of Science, Technology and Medicine, University of London (2001)
Inoue, K., Iwanuma, K.: Speculative computation through consequence-finding in multi-agent environments. Ann. Math. Artif. Intell. 42(1-3), 255–291 (2004)
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)
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)
Przymusinski, T.C.: The well-founded semantics coincides with the three-valued stable semantics. Fundam. Inform. 13(4), 445–463 (1990)
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)
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)
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)
Satoh, K., Yamamoto, K.: Speculative computation with multi-agent belief revision. In: AAMAS, pp. 897–904. ACM Press, New York (2002)
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)
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
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)
Author information
Authors and Affiliations
Editor information
Rights 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)