Possible Controllability of Control Argumentation Frameworks – Extended Version

09/10/2020
by   Jean-Guy Mailly, et al.
0

The recent Control Argumentation Framework (CAF) is a generalization of Dung's Argumentation Framework which handles argumentation dynamics under uncertainty; especially it can be used to model the behavior of an agent which can anticipate future changes in the environment. Here we provide new insights on this model by defining the notion of possible controllability of a CAF. We study the complexity of this new form of reasoning for the four classical semantics, and we provide a logical encoding for reasoning with this framework.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2018

Equipping sequent-based argumentation with defeasible assumptions

In many expert and everyday reasoning contexts it is very useful to reas...
research
01/16/2013

Risk Agoras: Dialectical Argumentation for Scientific Reasoning

We propose a formal framework for intelligent systems which can reason a...
research
02/07/2023

Qualitative uncertainty and dynamics of argumentation through dynamic logic

Dynamics and uncertainty are essential features of real-life argumentati...
research
10/25/2018

Cicero: Multi-Turn, Contextual Argumentation for Accurate Crowdsourcing

Traditional approaches for ensuring high quality crowdwork have failed t...
research
07/05/2022

Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs)

Recently, Strength-based Argumentation Frameworks (StrAFs) have been pro...
research
01/02/2012

Technical Note: Exploring Σ^P_2 / Π^P_2-hardness for Argumentation Problems with fixed distance to tractable classes

We study the complexity of reasoning in abstracts argumentation framewor...
research
12/17/2018

Trichotomic Argumentation Representation

The Aristotelian trichotomy distinguishes three aspects of argumentation...

Please sign up or login with your details

Forgot password? Click here to reset