On probabilistic argumentation and subargument-completeness. (7th September 2021)

• Record Type: Journal Article
• Authors: Riveret, Régis; Oren, Nir
• Is Part Of: Journal of logic and computation. Volume 32:Number 1(2022)
• Page Start: 115
• Page End: 128
• Publication Date: 2021-09-07
• Subjects: Abstract argumentation -- labelling semantics -- probabilistic argumentation; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exab053
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: Probabilistic argumentation combines probability theory and formal models of argumentation. Given an argumentation graph where vertices are arguments and edges are attacks or supports between arguments, the approach of probabilistic labellings relies on a probability space where the sample space is any specific set of argument labellings of the graph, so that any labelling outcome can be associated with a probability value. Argument labellings can feature a label indicating that an argument is not expressed, and in previous work these labellings were constructed by exploiting the subargument-completeness postulate according to which if an argument is expressed then its subarguments are expressed and through the use of the concept of 'subargument-complete subgraphs'. While the use of such subgraphs is interesting to compare probabilistic labellings with other works in the literature, it may also hinder the comprehension of a relatively simple framework. In this short communication, we revisit the construction of probabilistic labellings and demonstrate how labellings can be specified without reference to the concept of subargument-complete subgraphs. By doing so, the framework is simplified and yields a more natural model of argumentation.