Abstract argumentation offers an appealing way of representing and evaluating arguments
and counterarguments. This approach can be enhanced by considering probability …

In dialogical argumentation, it is often assumed that the involved parties will always correctly
identify the intended statements posited by each other and realize all of the associated …

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

Argumentation is inherently pervaded by uncertainty, which can arise as a result of the
context in which argumentation is used, the kinds of agents that are involved in a given …

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

We revisit the notion of i-extension, ie, the adaption of the fundamental notion of extension to
the case of incomplete Abstract Argumentation Frameworks. We show that the definition of …

After Dung's founding work in Abstract Argumentation Frameworks there has been a
growing interest in extending the Dung's semantics in order to describe more complex or …

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

Abstract Probabilistic Bipolar Abstract Argumentation Frameworks (prBAFs) are considered,
and the complexity of the fundamental problem of computing extensions' probabilities is …

Abstract argumentation is nowadays a vivid field within artificial intelligence and has seen
different developments recently. In particular, enrichments of the standard Dung frameworks …