Journal article Open Access
TheofrastosMantadelis; Stefano Bistarelli
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 real life situations. Several of these approaches take the direction of weighted or probabilistic extensions. One of the most prominent probabilistic approaches is that of constellation Probabilistic Abstract Argumentation Frameworks.
In this paper, we first make the connection of possible worlds and constellation semantics; we then introduce the probabilistic attack normal form for the constellation semantics; we furthermore prove that the probabilistic attack normal form is sufficient to represent any Probabilistic Abstract Argumentation Framework of the constellation semantics; then we illustrate its connection with Probabilistic Logic Programming and briefly present an existing implementation. The paper continues by also discussing the probabilistic argument normal form for the constellation semantics and proves its equivalent properties. Finally, this paper introduces a new probabilistic structure for the constellation semantics, namely probabilistic cliques.