Add to ORKGIn this paper we introduce a new set of general principles for probabilistic abstract argumentation. The main principle is a probabilistic analogue of SCC decomposability, which ensures that the probabilistic evaluation of an argumentation framework complies with the probabilistic (in)dependencies implied by the graph topology. We introduce various examples of probabilistic semantics and determine which principles they satisfy. Our work also provides new insights into the relationship between abstract argumentation and the theory of Bayesian networks
Gradual semantics are methods that evaluate overall strengths of individual arguments in graphs. In ...
We provide new insights into the area of combining abstract argumentation frameworks with probabili...
There is a generic way to add any new feature to a system. It involves 1) identifying the basic unit...
peer reviewedIn this paper we introduce a new set of general principles for probabilistic abstract a...
Combining computational models of argumentation with probability theory has recently gained increasi...
Abstract. Recently, there has been a proposal by Dung and Thang and by Li et al to extend abstract a...
This paper investigates the relations between Timmer et al.'s proposal for explaining Bayesian netwo...
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of D...
After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in...
Although Dung’s frameworks are widely approved tools for abstract argumentation, their abstractness ...
Evidence from studies, such as in science or medicine, often corresponds to conditional probability ...
In this paper, we extend Dung's seminal argument framework to form a probabilistic argument framewor...
The epistemic approach to probabilistic argumentation as- signs belief to arguments. This is valuabl...
ABSTRACT Probabilistic argumentation combines the quantitative uncertainty accounted by probability ...
In this paper I present a proposal on how to conceptualise and handle probabilistic arguments in an ...
Gradual semantics are methods that evaluate overall strengths of individual arguments in graphs. In ...
We provide new insights into the area of combining abstract argumentation frameworks with probabili...
There is a generic way to add any new feature to a system. It involves 1) identifying the basic unit...
peer reviewedIn this paper we introduce a new set of general principles for probabilistic abstract a...
Combining computational models of argumentation with probability theory has recently gained increasi...
Abstract. Recently, there has been a proposal by Dung and Thang and by Li et al to extend abstract a...
This paper investigates the relations between Timmer et al.'s proposal for explaining Bayesian netwo...
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of D...
After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in...
Although Dung’s frameworks are widely approved tools for abstract argumentation, their abstractness ...
Evidence from studies, such as in science or medicine, often corresponds to conditional probability ...
In this paper, we extend Dung's seminal argument framework to form a probabilistic argument framewor...
The epistemic approach to probabilistic argumentation as- signs belief to arguments. This is valuabl...
ABSTRACT Probabilistic argumentation combines the quantitative uncertainty accounted by probability ...
In this paper I present a proposal on how to conceptualise and handle probabilistic arguments in an ...
Gradual semantics are methods that evaluate overall strengths of individual arguments in graphs. In ...
We provide new insights into the area of combining abstract argumentation frameworks with probabili...
There is a generic way to add any new feature to a system. It involves 1) identifying the basic unit...