This chapter provides an overview of possibility theory, emphasizing its historical roots and
its recent developments. Possibility theory lies at the crossroads between fuzzy sets …

Argumentation can be modelled at an abstract level using a directed graph where each
node denotes an argument and each arc denotes an attack by one argument on another …

With respect to the necessity (Nec) measure, suggesting by Dubois and Prade, there is a
dearth of any procedure or formula to deal with equality chance constraints. Therefore, this …

Abstract Argumentation represents a way of reasoning over a knowledge base containing
possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a …

Recently, there has been a proposal by Dung and Thang and by Li et al to extend abstract
argumentation to take uncertainty of arguments into account by assigning a probability value …

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 …

User support systems have evolved in the last years as specialized tools to assist users in a
plethora of computer-mediated tasks by providing guidelines or hints 19. Recommender …

Multi-adjoint logic programming is a general framework with interesting features, which
involves other positive logic programming frameworks such as monotonic and residuated …

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