We tackle the problem of expressing incomplete knowledge in abstract argumentation
frameworks originally introduced by Dung [26]. In applications, incomplete argumentation …

Probabilistic abstract argumentation combines Dung's abstract argumentation framework
with probability theory in order to model uncertainty in argumentation. In this setting, we …

The complexity of the probabilistic counterparts of the classical verification and acceptance
problems is investigated over probabilistic Abstract Argumentation Frameworks (prAAFs), in …

On the Complexity of Probabilistic Abstract Argumentation Page 1 Introduction Background
Complexity results Conclusions and future work On the Complexity of Probabilistic Abstract …

We tackle the problem of expressing incomplete knowledge about the attack relation in
abstract argumentation frameworks. In applications, incomplete argumentation frameworks …

We address the problem of efficiently recomputing the extensions of abstract argumentation
frameworks (AFs) which are updated by adding/deleting arguments or attacks. In particular …

Bipolar argumentation frameworks (BAFs) extend Dung's argumentation frameworks to
explicitly represent the notion of support between arguments, in addition to that of attack …

Probabilistic abstract argumentation is an extension of Dung's abstract argumentation
framework with probability theory. In this setting, we address the problem of computing the …

When informal arguments are presented, there may be imprecision in the language used,
and so the audience may be uncertain as to the structure of the argument graph as intended …

Extended argumentation frameworks (EAFs) extend Dung's argumentation frameworks
(AFs) to represent a kind of defeasible attack (by relying on the concept of second-order …