Document Type

Article

Rights

Available under a Creative Commons Attribution Non-Commercial Share Alike 4.0 International Licence

Disciplines

Probability, Computer Sciences, Information Science

Publication Details

Cybernetics and systems, Vol. 45, Issue 3, 2014.

Abstract

In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of Dung abstract argumentation frameworks in which each argument n is asserted with a probability p(n). The debate around PAFs has so far centered on their theoretical definition and basic properties. This work contributes to their computational analysis by proposing a first recursive algorithm to compute the probability of acceptance of each argument under grounded and preferred semantics, and by studying the behavior of PAFs with respect to reinstatement, cycles and changes in argument structure. The computational tools proposed may provide strategic information for agents selecting the next step in an open argumentation process and they represent a contribution in the debate about gradualism in abstract argumentation.

DOI

https://doi.org/10.1080/01969722.2014.894854

Funder

School of Computing

Download


Share

COinS