Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs: Theory and Empirical Results

08/01/2016
by   Beishui Liao, et al.
0

In existing literature, while approximate approaches based on Monte-Carlo simulation technique have been proposed to compute the semantics of probabilistic argumentation, how to improve the efficiency of computation without using simulation technique is still an open problem. In this paper, we address this problem from the following two perspectives. First, conceptually, we define specific properties to characterize the subgraphs of a PrAG with respect to a given extension, such that the probability of a set of arguments E being an extension can be defined in terms of these properties, without (or with less) construction of subgraphs. Second, computationally, we take preferred semantics as an example, and develop algorithms to evaluate the efficiency of our approach. The results show that our approach not only dramatically decreases the time for computing p(E^σ), but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a given extension E is, the more efficient our approach computes p(E^σ). Meanwhile, it is shown that under complete and preferred semantics, the problems of determining p(E^σ) are fixed-parameter tractable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2014

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

We study the computational complexity of problems that arise in abstract...
research
12/14/2022

Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation

In this paper we propose a general approach to define a many-valued pref...
research
01/16/2014

Change in Abstract Argumentation Frameworks: Adding an Argument

In this paper, we address the problem of change in an abstract argumenta...
research
08/22/2019

SCF2 – an Argumentation Semantics for Rational Human Judgments on Argument Acceptability: Technical Report

In abstract argumentation theory, many argumentation semantics have been...
research
12/19/2020

On graded semantics of abstract argumentation: Extension-based case

Based on Grossi and Modgil's recent work [1], this paper considers some ...
research
03/18/2015

Probabilistic Argumentation. An Equational Approach

There is a generic way to add any new feature to a system. It involves 1...
research
05/06/2022

Rediscovering Argumentation Principles Utilizing Collective Attacks

Argumentation Frameworks (AFs) are a key formalism in AI research. Their...

Please sign up or login with your details

Forgot password? Click here to reset