AFRA: Argumentation framework with recursive attacks
arXiv:1810.04886 · doi:10.1016/j.ijar.2010.05.004
Abstract
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.
Cited by in corpus (14)
- On the Intertranslatability of Argumentation Semantics
- ABA+: Assumption-Based Argumentation with Preferences
- Epistemic Graphs for Representing and Reasoning with Positive and Negative Influences of Arguments
- Automata for Infinite Argumentation Structures
- Properties of ABA+ for Non-Monotonic Reasoning
- Characterizing Realizability in Abstract Argumentation
- An encoding of argumentation problems using quadratic unconstrained binary optimization
- On SCC-recursiveness in Quantitative Argumentation
- Proceedings of the First International Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016)
- Understanding the Abstract Dialectical Framework (Preliminary Report)
- Empirical Evaluation of Abstract Argumentation: Supporting the Need for Bipolar and Probabilistic Approaches
- A Formalisation of Abstract Argumentation in Higher-Order Logic
- The Attack as Strong Negation, Part I
- Abstract Argumentation / Persuasion / Dynamics