Self-Stabilizing Distributed Algorithms for Defeat Status Computation in Argumentation

Authors:
Massimiliano Giacomin
Affiliations:
-
Venue:
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Year:
2002

Citing 10
Cited 3

The society of mind

The society of mind
How to reason defeasibly

Artificial Intelligence
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Abstract argumentation systems

Artificial Intelligence
A dynamic self-stabilizing algorithm for finding strongly connected components

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization

Self-stabilization
Extending abstract argumentation systems theory

Artificial Intelligence
Cognitive Carpentry: A Blueprint for how to Build a Person

Cognitive Carpentry: A Blueprint for how to Build a Person
A distributed self-stabilizing algorithm for argumentation

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization

Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems

Artificial Intelligence
Agents' roles in B2C e-commerce

AI Communications
Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Argumentation is receiving an increasing attention as a technique for practical and uncertain reasoning underlying the realization of intelligent autonomous agents. In line with the evolution of agent architectures towards distribution, we propose a distributed approach to argumentation, where independent processes construct arguments and revise their defeat status by exploiting local information only. We present and compare two distributed self-stabilizing algorithms for defeat status computation, one specifically tailored to rebutting defeat, and the other able to handle any form of defeat. The property of self-stabilization is enforced to ensure a globally correct behavior of the system.