AFRA: Argumentation framework with recursive attacks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 2.
6 papers.
- 2021A Formalisation of Abstract Argumentation in Higher-Order Logiccited by 1
- 2022Abstract argumentation and answer set programming: two faces of Nelson's logiccited by 0
- 2022Research Note on Uncertain Probabilities and Abstract Argumentationcited by 0
- 2023Semi-Abstract Value-Based Argumentation Frameworkcited by 0
- 2024Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mappingcited by 0
- 2024An encoding of argumentation problems using quadratic unconstrained binary optimizationcited by 0
- 2024An encoding of argumentation problems using quadratic unconstrained binary optimization9 Sep 2024
- 2024Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping14 Aug 2024
- 2023Semi-Abstract Value-Based Argumentation Framework25 Sep 2023
- 2022Research Note on Uncertain Probabilities and Abstract Argumentation23 Aug 2022
- 2022Abstract argumentation and answer set programming: two faces of Nelson's logic27 Mar 2022
- 2021A Formalisation of Abstract Argumentation in Higher-Order Logic18 Oct 2021