Distributed Truth Maintenance

In this paper we define the concept of logical consistency of belief among a group of computational agents that are able to reason nonmonotonically. We then provide an algorithm for truth maintenance that guarantees local consistency for each agent and global consistency for data shared by the agents. Furthermore we show the algorithm to be complete, in the sense that if a consistent state exists, the algorithm will either find it or report failure. The algorithm has been implemented in the RAD distributed expert system shell.

[1]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[2]  Rowland R. Johnson,et al.  DATMS: A Framework for Distributed Assumption Based Reasoning , 1989, Distributed Artificial Intelligence.

[3]  David A. McAllester.  An Outlook on Truth Maintenance. , 1980 .

[4]  J. Dekleer.  An assumption-based TMS , 1986 .

[5]  Stuart C. Shapiro,et al.  A Model for Belief Revision , 1988, Artif. Intell..

[6]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[7]  Alan Bundy,et al.  Truth Maintenance System , 1984 .

[8]  Jeffrey S. Rosenschein,et al.  Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains , 1989, IJCAI.

[9]  Katia Sycara,et al.  Multiagent Compromise via Negotiation , 1989, Distributed Artificial Intelligence.

[10]  Alan H. Bond,et al.  Distributed Artificial Intelligence , 1988 .