Arg Teach - A Learning Tool for Argumentation Theory

Dauphin, Jérémie; Schulz, Cláudia

doi:10.1109/ictai.2014.120

Cited by 1 publication

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we consider update relations which give rise to the preferred and grounded semantics, and which are motivated by algorithms for computing these semantics that have been described by Dauphin and Schulz [9]. The algorithmic update relation for the grounded semantics first identifies the arguments which are only being attacked by arguments which are already labeled {out}, labels them as {in} and any argument they attack as {out}, and then repeats this process until no arguments can be further labeled, at which point it will label all remaining arguments as {undec}.…”

Section: Case Analysis: An Algorithmic Approach For Combining Preferrmentioning

confidence: 99%

See 1 more Smart Citation

A Dynamic Approach for Combining Abstract Argumentation Semantics

Dauphin

Cramer

Torre

2019

Dynamics, Uncertainty and Reasoning

View full text Add to dashboard Cite

argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a merge of two argumentation semantics, which is defined in such a way that the merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the merge operator, in particular how meaningfully combine features of naive-based and complete-based semantics.

show abstract

Section: Case Analysis: An Algorithmic Approach For Combining Preferrmentioning

confidence: 99%

“…Lab 9 can be reached using mfg stage mfg grnd by first applying mfg stage several times to reduce the epistemic labels on d and e to {out} and {in} respectively and then applying item 2 of Definition 21 with the interface I := {d}, the set S := {a, b, c} and the following parallel framework F 9 2 :…”

Section: Defining New Semantics Via Mergingmentioning

confidence: 99%