[Date Prev][Date Next][Date Index]

Talk Announcement: Wed, Feb 14, 2018, 14:00 c.t. - Jorgen Fandinno "Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports"

Dear Colleagues,

the Institute of Logic and Computation cordially invites you to the following talk:


Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports

Jorge Fandinno
IRIT, Universite de Toulouse, CNRS

DATE: 	Feb 14th, 2018
TIME: 	14:00 c.t.
VENUE: 	Seminarraum Gödel, Favoritenstrasse 9-11

We present a generalisation of Dung’s abstract argumentation frameworks that allows representing positive
interactions (called supports). The notion of support studied here is based in the intuition that every
argument must be supported by some chain of supports from some special arguments called prima-facie. The
theory developed also allows the representation of both recursive attacks and supports, that is, a class
of attacks or supports whose targets are other attacks or supports. The classic role of attacks in
defeating arguments is replaced by a subset of them, which is extension dependent and which, intuitively,
represents a set of “valid attacks” with respect to the extension. Similarly, only the subset of “valid
supports” is allowed to support other elements (arguments, attacks or supports). This theory displays a
conservative generalisation of Dung’s semantics (complete, preferred and stable) and also of its
principles (conflict-freeness, acceptability and admissibility). When restricted to finite non-recursive
frameworks, we are also able to prove a one-to-one correspondence with Evidence-Based Argumentation
(EBA). When supports are ignored a one-to-one correspondence with AFRA semantics is also established.


With kind support of the Vienna Center for Logic and Algorithms (VCLA) and
the Wolfgang Pauli Institut (WPI).