Some Foundations for Probabilistic Abstract Argumentation
Anthony Hunter · Frontiers in artificial intelligence and applications · 2012
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 to each argument, and then use this assignment to determine the probability that a set of arguments is an extension. In this paper, we explore some of the assumptions behind the definitions, and some of the resulting properties, of the proposal for probabilistic argument graphs.