language-icon Old Web
English
Sign In

Probabilistic argumentation

Probabilistic argumentation refers to different formal frameworks in the literature. All share the idea that qualitative aspects can be captured by an underlying logic, while quantitative aspects of uncertainty can be accounted for by probabilistic measures. Probabilistic argumentation refers to different formal frameworks in the literature. All share the idea that qualitative aspects can be captured by an underlying logic, while quantitative aspects of uncertainty can be accounted for by probabilistic measures. The framework of 'probabilistic labellings' refers to probability spaces where the sample space is a set of labellings of argumentation graphs. As a labelling of an argumentation graph associates any argument with a label to reflect the acceptability of the argument (if the labelling is total), the approach of probabilistic labellings associates an arguments with the probability of a label to reflect the probability of the argument to be labelled as such. The name 'probabilistic argumentation' has been used to refer to a particular theory of reasoning that encompasses uncertainty and ignorance, combining probability theory and deductive logic, and thus consisting in a probabilistic logic (Haenni, Kohlas & Lehmann 2000). OpenPAS is an open-source implementation of such a probabilistic argumentation system. Probabilistic argumentation systems encounter a problem when used to determine the occurrence of Black Swan events since, by definition, those events are so improbable as to seem impossible. As such, probabilistic arguments should be considered fallacious arguments known as appeals to probability.

[ "Probabilistic logic", "Argumentation theory" ]
Parent Topic
Child Topic
    No Parent Topic