15,408 research outputs found
Implementing Argumentation-enabled Empathic Agents
In a previous publication, we introduced the core concepts of empathic agents
as agents that use a combination of utility-based and rule-based approaches to
resolve conflicts when interacting with other agents in their environment. In
this work, we implement proof-of-concept prototypes of empathic agents with the
multi-agent systems development framework Jason and apply argumentation theory
to extend the previously introduced concepts to account for inconsistencies
between the beliefs of different agents. We then analyze the feasibility of
different admissible set-based argumentation semantics to resolve these
inconsistencies. As a result of the analysis we identify the maximal ideal
extension as the most feasible argumentation semantics for the problem in
focus.Comment: Accepted for/presented at the 16th European Conference on Multi-Agent
Systems (EUMAS 2018
Case-Based Argumentation Framework. Dialogue Protocol
On top of the simpler ability to interact, open MAS must include mechanisms for their agents to reach agreements by taking into account their social context. Argumentation provides MAS with a framework that assures a rational communication, which allows agents to reach agreements when conflicts of opinion arise. In this report we present the communication protocol that agents of a case-based argumentation framework use to interact when they engage in argumentation dialogues. The syntax and semantics of the framework are formalised and discussed.Heras Barberá, SM.; Botti Navarro, VJ.; Julian Inglada, VJ. (2011). Case-Based Argumentation Framework. Dialogue Protocol. http://hdl.handle.net/10251/1109
Preservation of Semantic Properties during the Aggregation of Abstract Argumentation Frameworks
An abstract argumentation framework can be used to model the argumentative
stance of an agent at a high level of abstraction, by indicating for every pair
of arguments that is being considered in a debate whether the first attacks the
second. When modelling a group of agents engaged in a debate, we may wish to
aggregate their individual argumentation frameworks to obtain a single such
framework that reflects the consensus of the group. Even when agents disagree
on many details, there may well be high-level agreement on important semantic
properties, such as the acceptability of a given argument. Using techniques
from social choice theory, we analyse under what circumstances such semantic
properties agreed upon by the individual agents can be preserved under
aggregation.Comment: In Proceedings TARK 2017, arXiv:1707.0825
A Parameterised Hierarchy of Argumentation Semantics for Extended Logic Programming and its Application to the Well-founded Semantics
Argumentation has proved a useful tool in defining formal semantics for
assumption-based reasoning by viewing a proof as a process in which proponents
and opponents attack each others arguments by undercuts (attack to an
argument's premise) and rebuts (attack to an argument's conclusion). In this
paper, we formulate a variety of notions of attack for extended logic programs
from combinations of undercuts and rebuts and define a general hierarchy of
argumentation semantics parameterised by the notions of attack chosen by
proponent and opponent. We prove the equivalence and subset relationships
between the semantics and examine some essential properties concerning
consistency and the coherence principle, which relates default negation and
explicit negation. Most significantly, we place existing semantics put forward
in the literature in our hierarchy and identify a particular argumentation
semantics for which we prove equivalence to the paraconsistent well-founded
semantics with explicit negation, WFSX. Finally, we present a general proof
theory, based on dialogue trees, and show that it is sound and complete with
respect to the argumentation semantics.Comment: To appear in Theory and Practice of Logic Programmin
Applying Abstract Argumentation Theory to Cooperative Game Theory
We apply ideas from abstract argumentation theory to study cooperative game
theory. Building on Dung's results in his seminal paper, we further the
correspondence between Dung's four argumentation semantics and solution
concepts in cooperative game theory by showing that complete extensions (the
grounded extension) correspond to Roth's subsolutions (respectively, the
supercore). We then investigate the relationship between well-founded
argumentation frameworks and convex games, where in each case the semantics
(respectively, solution concepts) coincide; we prove that three-player convex
games do not in general have well-founded argumentation frameworks.Comment: 15 pages, 1 tabl
Arguing Using Opponent Models
Peer reviewedPostprin
- …