Abstract
Answer sharing is a key element in multi-agent systems as it allows agents to collaborate towards achieving a global goal. However exogenous knowledge of the world can influence each agent’s local computation, and communication channels may introduce delays, creating multiple partial answers at different times. Agent’s answers may, therefore, be incomplete and revisable, giving rise to the concept of speculative reasoning, which provides a framework for managing multiple revisable answers within the context of multi-agent systems. This paper extends existing work on speculative reasoning by introducing a new abductive framework to hierarchical speculative reasoning. This allows speculative reasoning in the presence of both negation and constraints, enables agents to receive conditional answers and to continue their local reasoning using default answers, thus increasing the parallelism of agents collaboration. The paper describes the framework and its operational model, illustrates the main features with an example and states soundness and completeness results.
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
Burton, F.W.: Speculative computation, parallelism, and functional programming. IEEE Trans. Computers 34(12), 1190–1193 (1985)
Ceberio, M., Hosobe, H., Satoh, K.: Speculative constraint processing with iterative revision for disjunctive answers. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol. 3900, pp. 340–357. Springer, Heidelberg (2006)
Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in alias: a logic framework for agents that negotiate. Annals of Math. and AI, 65–91 (2003)
Gregory, S.: Experiments with speculative parallelism in parlog. In: ILPS 1993: Proceedings of the 1993 International Symposium on Logic Programming, pp. 370–387. MIT Press, Cambridge (1993)
Hayashi, H.: Replanning in robotics by dynamic SLDNF. In: Proc. Workshop on Scheduling and Planning meet Real-time Monitoring in a Dynamic and Uncertain World (1999)
Hayashi, H., Tokura, S., Hasegawa, T., Ozaki, F.: Dynagent: An Incremental Forward-Chaining HTN Planning Agent in Dynamic Domains. In: Baldoni, M., Endriss, U., Omicini, A., Torroni, P. (eds.) DALT 2005. LNCS (LNAI), vol. 3904, pp. 171–187. Springer, Heidelberg (2006)
Hosobe, H., Satoh, K., Ma, J., Russo, A., Broda, K.: Speculative constraint processing for hierarchical agents. In: Proc. of 7th European Workshop on MAS, EUMAS 2009 (2009)
Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. J. Log. Prog., 1–46 (1998)
Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Comp. 2(6), 719–770 (1992)
Lloyd, J.W.: Foundations of logic programming, 2nd extended edn. Springer, New York (1987)
Ma, J., Russo, A., Broda, K., Clark, K.: DARE: a system for distributed abductive reasoning. Autonomous Agents and Multi-Agent Systems 16(3), 271–297 (2008)
Nabeshima, H., Iwanuma, K., Inoue, K.: Effective sat planning by speculative computation. In: Proc. of the 15th Australian Joint Conf. on AI, pp. 726–728. Springer, London (2002)
Satoh, K.: Speculative computation and abduction for an autonomous agent. IEICE Transactions 88-D(9), 2031–2038 (2005)
Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by abduction under incomplete communication environments. In: ICMAS, pp. 263–270 (2000)
Satoh, K., Yamamoto, K.: Speculative computation with multi-agent belief revision. In: AAMAS, pp. 897–904 (2002)
Shanahan, M.: Reinventing shakey. In: Logic-based artificial intelligence, pp. 233–253 (2000)
Teusink, F.: Three-valued completion for abductive logic programs. In: Proc. of the 4th Int. Conf. on Algebraic and Logic Programming, pp. 171–200. Elsevier Science Inc., New York (1996)
Van Nuffelen, B.: Abductive constraint logic programming: implementation and applications, Phd, Department of Computer Science, K.U.Leuven, Belgium (June 2004)
Wallace, M.: Negation by constraints: A sound and efficient implementation of negation in deductive databases. In: SLP, pp. 253–263 (1987)
Clark, K.: 1Negation as failure. In: Logic and Data Bases, pp. 293–322 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, J., Broda, K., Goebel, R., Hosobe, H., Russo, A., Satoh, K. (2010). Speculative Abductive Reasoning for Hierarchical Agent Systems. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2010. Lecture Notes in Computer Science(), vol 6245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14977-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-14977-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14976-4
Online ISBN: 978-3-642-14977-1
eBook Packages: Computer ScienceComputer Science (R0)