AFRA: Argumentation framework with recursive attacks

10/11/2018
by   Pietro Baroni, et al.
0

The issue of representing attacks to attacks in argumentation is receiving an increasing attention as a useful conceptual modelling tool in several contexts. In this paper we present AFRA, a formalism encompassing unlimited recursive attacks within argumentation frameworks. AFRA satisfies the basic requirements of definition simplicity and rigorous compatibility with Dung's theory of argumentation. This paper provides a complete development of the AFRA formalism complemented by illustrative examples and a detailed comparison with other recursive attack formalizations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2020

The SCC-recursiveness Principle in Fuzzy Argumentation Frameworks

Dung's abstract argumentation theory plays a guiding role in the field o...
research
05/30/2022

Theme Aspect Argumentation Model for Handling Fallacies

In this paper, we present a novel approach to identify fallacies through...
research
03/19/2019

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

Abstract Persuasion Argumentation (APA) is a dynamic argumentation forma...
research
11/25/2016

Bipolar Weighted Argumentation Graphs

This paper discusses the semantics of weighted argumentation graphs that...
research
03/02/2020

On the Existence of Characterization Logics and Fundamental Properties of Argumentation Semantics

Given the large variety of existing logical formalisms it is of utmost i...
research
04/18/2018

A General Account of Argumentation with Preferences

This paper builds on the recent ASPIC+ formalism, to develop a general f...
research
12/12/2012

ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints

ConArg is a Constraint Programming-based tool that can be used to model ...

Please sign up or login with your details

Forgot password? Click here to reset