Michael N. Huhns and David M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1437--1445, - 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....combining their beliefs on shared variables, we have shown that the resultant representation of a cooperative multiagent system is an MSBN or some equivalent. This result aids comparison with related frameworks. Multiagent inference frameworks based on default reasoning (e.g. DATMS [16] and DTMS [8]) do not admit BC 1, nor does the blackboard [19] The BDI architecture [22] has been very influential in building multiagent systems. It primarily deals with representation of an agent s mental state for practical reasoning [26] although it has been extended to deal with communications between ....

M.N. Huhns and D.M. Bridgeland. Multiagent truth maintenance. IEEE Trans. Sys., Man, and Cybernetics, 21(6):1437-- 1445, 1991.

....and the agents are required to satisfy all constraints by communicating with each other. Many problems in multi agent systems, such as distributed interpretation problems[9] distributed resource allocation problems[3] distributed scheduling problems[11] and multi agent truth maintenance systems[7], can be formalized as Distributed CSPs. On the other hand, when a problem designer tries to describe a real life problem as a CSP, the resulting CSP is often over constrained and has no solutions. For such an over constrained CSP, almost all conventional CSP algorithms just produce a result that ....

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics,Vol. 21, No. 6, pp. 1437--1445, 1991.

....is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI that are concerned with finding a consistent combination of agent actions can be formalized as distributed CSPs. For example, a multiagent truth maintenance system [2] is a distributed version of a truth maintenance system [3] In this system, there exist multiple agents, each of which has its own truth maintenance system. Each agent has uncertain data that can be IN or OUT, i.e. believed or not believed, and each shares some data with other agents. Each agent ....

M. N. Huhns and D. M. Bridgeland, "Multiagent truth maintenance", IEEE Transactions on Systems, Man and Cybernetics, vol. 21, no. 6, pp. 1437--1445, 1991.

.... with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [4] distributed scheduling problems [21] 2 Figure1.Example of a Constraint Satisfaction Problem (4 queens) distributed interpretation tasks [16] and multi agent truth maintenance tasks [13]) can be formalized as distributed CSPs. Therefore, we can consider distributed algorithms for solving distributed CSPs as an important infrastructure in MAS. This paper gives an overview of the existing research on distributed CSPs. First, we show the problem definition of a normal, centralized ....

....for security privacy reasons. In such cases, multiple agents have to solve the problem without centralizing all information. 4. Application Problems of Distributed CSPs Various application problems in MAS can be formalized as distributed CSPs. For example, a multi agent truth maintenance system [13] is a distributed version of a truth maintenance system [7] In this system, there exist multiple agents, each of which has its own truth maintenance system (Figure 2) Each agent has uncertain data that can be IN or OUT, i.e. believed or not believed, and each shares some data with other agents. ....

Huhns, M. N. and D. M. Bridgeland: 1991, `MultiagentTruth Maintenance'. IEEE Transactions on Systems, Man and Cybernetics 21(6), 1437--1445.

.... Various application problems in Multiagent Systems (MAS) that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [5] distributed scheduling problems [11] distributed interpretation tasks [9] and multiagent truth maintenance tasks [7]) can be formalized as distributed CSPs. Therefore, we can consider distributed algorithms for solving distributed CSPs as an important infrastructure in MAS. It must be noted that although algorithms for solving distributed CSPs seem to be similar to parallel distributed processing methods for ....

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437--1445, 1991.

....a consistent combination of actions under some constraints about taking their actions. Such a problem includes the distributed interpretation problem [6] the distributed resource allocation problem [2] the distributed scheduling problem [9] and the problem in multi agent truth maintenance tasks [5]. These problems are naturally described as a distributed constraint satisfaction problem (distributed CSP) 12, 13] A distributed CSP is a constraint satisfaction problem where variables and constraints are distributed among multiple agents. A solution to a distributed CSP is a set of values to ....

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437--1445, 1991.

....this notion, essential to the multi agent case as we show in the sequence is absent. 5. 2 Belief Revision in a Multi Agent Context Several researchers have been working in the last years in theoretical models for multi agent belief revision [23, 24, 19] and in distributed TMS (DTMS) [31, 28, 29]. 5 The usage of our social reasoning mechanism to deal with the other phases are out of scope of this work and may be found in [40] 6 This principle has been also applied to a multi agent context, like in [22] In [31, 28] agents are assumed to be benevolent by hypothesis. Whenever an ....

.... belief revision [23, 24, 19] and in distributed TMS (DTMS) 31, 28, 29] 5 The usage of our social reasoning mechanism to deal with the other phases are out of scope of this work and may be found in [40] 6 This principle has been also applied to a multi agent context, like in [22] In [31, 28], agents are assumed to be benevolent by hypothesis. Whenever an agent receives an information from an agent who is responsible for it, he updates his belief base, choosing this last context. In [29] this decision criterion is not so rigid: whenever an agent detects a contradiction between an ....

[Article contains additional citation context not shown here]

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437--1445, 1991.

....is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI that are concerned with finding a consistent combination of agent actions can be formalized as distributed CSPs. For example, a multiagent truth maintenance system [2] is a distributed version of a truth maintenance system [3] In this system, there exist multiple agents, each of which has its own truth maintenance system. Each agent has uncertain data that can be IN or OUT, i.e. believed or not believed, and each shares some data with other agents. Each agent ....

# M.N. Huhns and D.M. Bridgeland, "Multiagent Truth Maintenance, " IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 6, pp. 1,437--1,445, 1991.

.... 35 40 45 50 0 100 200 300 400 500 600 Time No of agents Responce time Problem solving request 80 120 deadline No of Agent Response Time Figure 7: Performance Evaluation logical dependency model and its maintenance mechanisms such as DTMS (Distributed Truth Maintenance System) [Huhns and Bridgeland, 1991] or distributed constraint satisfaction algorithms [Yokoo et al. 1992] have been introduced to overcome this problem. The issue of control becomes more and more seriousinmultiagent production systems. Because various events occur asynchronously in a multiagent network, the agents must ....

M. N. Huhns and D. M. Bridgeland, "MultiagentTruth Maintenance," IEEE Trans. SMC,Vol. 21, No. 6, pp. 1437-1445, 1991.

....CSP. Various application problems in multiagent systems that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems[4] distributed scheduling problems[15] distributed interpretation tasks[11] and multi agent truth maintenance tasks[10]) can be formalized as distributed CSPs. Distributed algorithms for solving distributed CSPs (distributed constraint satisfaction algorithms) have recently been developed by several authors [1, 7, 8, 16, 17, 18] For solving a distributed CSP by a distributed constraint satisfaction algorithm, ....

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, pp. 1437--1445, 1991.

....a consistent combination of actions under some constraints about taking their actions. Such a problem includes the distributed interpretation problem [6] the distributed resource allocation problem [2] the distributed scheduling problem [9] and the problem in multi agent truth maintenance tasks [5]. These problems are naturally described as distributed constraint satisfaction problems (distributed CSPs) 12, 13] A distributed CSP is a constraint satisfaction problem where variables and constraints are distributed among multiple agents. A solution to a distributed CSP is a set of values to ....

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437--1445, 1991.

.... application problems in Multiagent Systems (MAS) that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [7] distributed scheduling problems [20] distributed interpretation tasks [16] and multi agent truth maintenance tasks [14]) can be formalized as distributed CSPs. Therefore, we have considered an efficient distributed algorithm for solving a distributed CSP as an important infrastructure in MAS. The author has proposed the asynchronous weakcommitment search algorithm (AWC) 22, 24] for solving a distributed CSP. All ....

Huhns, M. N. and Bridgeland, D. M.: Multiagent Truth Maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6) (1991) 1437--1445

....on internal variables and combining their belief on shared ones, we have shown that the resultant representation of a CMADIS is a MSBN or some equivalent. 13 This result aids comparison with related frameworks. Multiagent inference frameworks based on default reasoning (e.g. DATMS [10] and DTMS [3]) do not admit BC 1, nor does the blackboard [12] Several frameworks for decomposition of probabilistic knowledge has been proposed. Abstract network [8] replaces fragments of a centralized BN by abstract arcs to improve inference efficiency. Similarity network and Bayesian multinet [2] ....

M.N. Huhns and D.M. Bridgeland. Multiagent truth maintenance. IEEE Trans. Sys., Man, and Cybernetics, 21(6):1437--1445, 1991.

....to apply the second phase of an EBL procedure to generalize the plausible model of y, and the efficient revision of the model based on incoming beliefs. 8 Related work Despite a real wealth of work on nonmonotonic logic, there are not many attempts to extend such formalisms to MAS. In [4,8] nonmonotonic behaviour is treated at procedural level. In [11] Perrault proposes, at a formal level, an axiomatization of inter agent communication based on possible world semantics and Reiter s default logic, further developed in [15] by an axiomatization of belief transfer in a nonmonotonic ....

M.N. Huhns and D.M. Bridgeland, Multiagent truth maintenance, IEEE Trans. on Systems, Man and Cybernetics 21 (1991) 1437-1445.

....neither a formal definition of a preferred extension. 3 Assumption based agents in TLI Several researches have been devoted to intelligent MAS but very few took in consideration nonmonotonic reasoning agents, almost all of these being at a procedural level and ignoring communicative acts [6,2]. At a formal level, Perrault [8] proposed an axiomatization of inter agent communication [11] based on possible worlds semantics and Reiter s default logic [10] His approach suffers from the inherent limitation of possible worlds semantics, namely the implication that the agents are logically ....

Huhns M.N. and D.M. Bridgeland, "Multiagent truth maintenance", IEEE Trans. on Systems, Man and Cybernetics, vol. 21, p.1437-1445, (1991).

....at Austin 3 analyzed goal conflicts among cooperative agents [31] and agents that are not fully cooperative [27] Resource conflicts [22] as well as plan conflicts [29] have also been specifically examined. In addition, methods for maintaining coherent agent beliefs have also been investigated [12]. Chu Carroll and Carberry use two categories (actions and beliefs) to describe, detect, and resolve conflict [7] The action category deals with conflicts among both agents goals and plans. Combining these various viewpoints and distilling them to reveal the fundamental nature of different types ....

Huhns, M. N. and Bridgeland, D. M. 1991. Multiagent Truth Maintenance. IEEE Transactions on Systems, Man, and Cybernetics, Special Issue on Distributed Artificial Intelligence 21(6): 1437-1445.

....several useful cases, be assigned to the member agents. We believe the relationship of our approach to open nested transaction models and workflows will lead to superior multiagent systems for information applications. Distributed assumption based [ Mason Johnson, 1989 ] or justification based [ Huhns Bridgeland, 1991 ] truth maintenance systems (DTMSs) are also germane. These systems help a group of agents revise their beliefs as a consequence of messages received. On the one hand, DTMSs can be given a knowledge level characterization in terms of commitments; on the other hand, they can be used to implement ....

Huhns, Michael N. and Bridgeland, David M.; 1991. Multiagent truth maintenance. IEEE Transactions on Systems, Man, and Cybernetics 21(6):1437--1445.

.... research has been undertaken to devise methods for the parallelization of the program execution procedure (e.g. CDKR90] CHH89] In the later case, the recent advances in Distributed Artificial Intelligence [MCD96] have been applied in the development of some logicbased systems (e.g. MJ89] [HB91], Hew91] MJO94] In this paper, we describe a knowledge representation system and its underlying architecture. The system supports a first order logic language and presents theorem proving and logic programming capabilities. These capabilities are implemented by a society of computational ....

M.N. Huhns and D.M. Bridgeland. Multi-agent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437-- 1445, 1991.

....assumptions; if no label is sent, it is impossible to cross check the external fact s foundations with the local TMS data. In the first case the agents exhibit local and shared wellfoundedness and local coherency, whilst in the second case there is only local well foundedness and local coherency [Huhns, 1991]. We chose the latter because we believe it is more appropriate for modelling real world autonomous agents that have their own beliefs, desires and intentions. Consequently, the community of agents behaves like a democratic society in which each individual can hold a different opinion once it is ....

....of deciding in which acquaintance an agent should believe. Some meta level control actions are included on top of the already described belief revision algorithm to act as a filter for the incoming data: Huhns and Bridgeland implemented a distributed JTMS that provides local and shared coherence [Huhns, 1991]. Their system suffers from the typical JTMS problems: computational overhead (not suitable for real world applications) and possible unsatisfiable circularities. In addition their implementation allows an agent with less information to dominate a more knowledgeable agent and their system is ....

M. N. Huhns and D. M. Bridgeland, (1991) "Multi-Agent Truth Maintenance" IEEE Trans. on Systems, Man and Cybernetics 21 (6), 1437-1445. Distributed AI 5 B. Malheiro, N. R. Jennings and E. Oliveira

....states of a knowledge base by adjusting which data are believed and which are disbelieved. However, it is important for a group of agents to be able to assess and maintain the integrity of communicated information, as well as of their own knowledge. A multiagent TMS can provide this integrity [27]. We consider a modified justification based TMS, in which every datum has a set of justifications and an associated status of INTERNAL (believed, because of a valid local justification) EXTERNAL (believed, because another agent asserted it) or OUT (disbelieved) Consider a network of many ....

Michael N. Huhns and David M. Bridgeland. Multiagent Truth Maintenance. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, No. 6, pages 1437--1445, December 1991.

....agents. DCA supports human (user interface) and computational (knowledge based expert system) agents, as well as databases. Each expert system agent, called a RAD agent, can perform forward and backward reasoning, and includes a frame system with multiple inheritance, distributed truth maintenance [11], and contradiction resolution. The ESS manages communications among the agents: actors in the ESS serve as communication aides, one for each agent, and forward messages through the ESS treespace. Lastly, distribution services include the Declarative Resource Constraint Base (DRCB) The DRCB is an ....

Michael Huhns and David M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1437--1445, 1991.

No context found.

Michael N. Huhns and David M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1437--1445, - 1991.

No context found.

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics 21(6),1437-1445., 1991.

No context found.

M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics 21(6),1437-1445., 1991.

No context found.

Michael Huhns and David Bridgeland, "Multiagent Truth Maintenance," IEEE Transactions on Systems, Man, and Cybernetics, special issue on Distributed Artificial Intelligence, vol. 21, no. 6, 1437--1445, 1991.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC