Speculative Abductive Reasoning for Hierarchical Agent Systems

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.

[1]  Michael J. Maher,et al.  The Semantics of Constraint Logic Programs , 1998, J. Log. Program..

[2]  Bert Van Nuffelen Abductive constraint logic programming: implementation and applications. , 2004 .

[3]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[4]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[5]  Frank Teusink Three-Valued Completion for Abductive Logic Programs , 1994, ALP.

[6]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[7]  Ken Satoh,et al.  Speculative Computation and Abduction for an Autonomous Agent , 2005, IEICE Trans. Inf. Syst..

[8]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[9]  Evelina Lamma,et al.  Cooperation and Competition in ALIAS: A Logic Framework for Agents that Negotiate , 2004, Annals of Mathematics and Artificial Intelligence.

[10]  Mark Wallace,et al.  Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases , 1987, SLP.

[11]  Katsumi Inoue,et al.  Effective SAT Planning by Speculative Computation , 2002, Australian Joint Conference on Artificial Intelligence.

[12]  Hisashi Hayashi Replanning in Robotics by Dynamic SLDNF , 1999 .

[13]  Tetsuo Hasegawa,et al.  Dynagent: An Incremental Forward-Chaining HTN Planning Agent in Dynamic Domains , 2005, DALT.

[14]  Murray Shanahan,et al.  Reinventing Shakey , 2001 .

[15]  Krysia Broda,et al.  Speculative constraint processing for hierarchical agents , 2010, AI Commun..

[16]  Steve Gregory,et al.  Experiments with Speculative Parallelism in Parlog , 1993, ILPS.

[17]  Dale Miller,et al.  Proceedings of the 1993 international symposium on Logic programming , 1993, ICLP 1993.

[18]  F. Warren Burton,et al.  Speculative computation, parallelism, and functional programming , 1985, IEEE Transactions on Computers.

[19]  Martine Ceberio,et al.  Speculative Constraint Processing with Iterative Revision for Disjunctive Answers , 2005, CLIMA.

[20]  Chiaki Sakama,et al.  Speculative computation by abduction under incomplete communication environments , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[21]  Ken Satoh,et al.  Speculative computation with multi-agent belief revision , 2002, AAMAS '02.

[22]  Krysia Broda,et al.  DARE: a system for distributed abductive reasoning , 2008, Autonomous Agents and Multi-Agent Systems.