# AFRA: Argumentation framework with recursive attacks

arXiv: https://arxiv.org/abs/1810.04886 · HTML: https://mlsanity.com/paper/1810.04886/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Oct 2018.

## Built on by (most cited first, 6 of 6)

- [A Formalisation of Abstract Argumentation in Higher-Order Logic](https://mlsanity.com/paper/2110.09174/) (2021)
- [Abstract argumentation and answer set programming: two faces of Nelson's logic](https://mlsanity.com/paper/2203.14405/) (2022)
- [Research Note on Uncertain Probabilities and Abstract Argumentation](https://mlsanity.com/paper/2208.10932/) (2022)
- [Semi-Abstract Value-Based Argumentation Framework](https://mlsanity.com/paper/2309.14112/) (2023)
- [Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping](https://mlsanity.com/paper/2408.08916/) (2024)
- [An encoding of argumentation problems using quadratic unconstrained binary optimization](https://mlsanity.com/paper/2409.05524/) (2024)

## 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.