DATMS: A Framework for Distributed Assumption Based Reasoning

Mason, Cindy; Johnson, Ryan

doi:10.1016/b978-1-55860-092-8.50017-4

Cited by 57 publications

(31 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Potential DisCSPs are the problems dealing with the decision of a consistent combination of agent actions and decisions. Typical examples include distributed scheduling [13], distributed interpretation problems [14], multiagent truth maintenance systems (a distributed version of a truth maintenance system) [15,16] and distributed resource allocation problems in a communication network [17]. Owing to the conceptualization of a large number of distributed artificial intelligence (DAI) problems as DisCSPs, algorithms for solving DisCSP play a vital role in the development of DAI infrastructure [18].…”

Section: Related Workmentioning

confidence: 99%

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

2015

View full text Add to dashboard Cite

Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a customized ERE (environment, reactive rules and entities) algorithm for the SensorDCSP, which is otherwise proven as a computationally intractable problem. An amalgamation of the autonomy-oriented computing (AOC)-based algorithm (ERE) and genetic algorithm (GA) provides an early solution of the modeled DisCSP. Incorporation of GA into ERE facilitates auto-tuning of the simulation parameters, thereby leading to an early solution of constraint satisfaction. This study further contributes towards a model, built up in the NetLogo simulation environment, to infer the efficacy of the proposed approach.

show abstract

Section: Related Workmentioning

confidence: 99%

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

2015

View full text Add to dashboard Cite

show abstract

“…Distributed assumption-based truth maintenance system (DATMS) [17] and distributed truth maintenance system(DTMS) [18] extend centralized truth maintenance systems to distributed agents. The basic idea is to begin the knowledge base with a set of default assumptions which are uncertain.…”

Section: Related Workmentioning

confidence: 99%

Building Intelligent Sensor Networks with Multiagent Graphical Models

Xiang

2008

Studies in Computational Intelligence

View full text Add to dashboard Cite

“…Our framework can be used for the representation of result-sharing cooperating agents [14]. A complex task is statically decomposed into a set of simpler subtasks, each assigned to an agent.…”

Section: Informal Presentation and Intuitionsmentioning

confidence: 99%

Declarative semantics for contradictory modular logic programs

Analyti

Pramanik

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order < def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M. Because of the classical negation, conflicts may arise within and among modules. The partial order < def denotes the relative reliability of the predicate definitions contributing to the conflict. We present the reliable semantics for PMPs . The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.

show abstract

DATMS: A Framework for Distributed Assumption Based Reasoning

Cited by 57 publications

References 10 publications

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

Building Intelligent Sensor Networks with Multiagent Graphical Models

Declarative semantics for contradictory modular logic programs

Contact Info

Product

Resources

About