AFRA: argumentation framework with recursive attacks. 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.
Keywords for this software
References in zbMATH (referenced in 29 articles , 1 standard article )
Showing results 21 to 29 of 29.
- Dunne, Paul E.; Hunter, Anthony; McBurney, Peter; Parsons, Simon; Wooldridge, Michael: Weighted argument systems: basic definitions, algorithms, and complexity results (2011)
- Dvořák, Wolfgang; Woltran, Stefan: On the intertranslatability of argumentation semantics (2011)
- Gabbay, Dov M.: Dung’s argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger (2011)
- Gorogiannis, Nikos; Hunter, Anthony: Instantiating abstract argumentation with classical logic arguments: postulates and properties (2011)
- Hanh, D. D.; Dung, P. M.; Hung, N. D.; Thang, P. M.: Inductive defense for sceptical semantics of extended argumentation (2011)
- Modgil, Sanjay; Bench-Capon, Trevor J. M.: Metalevel argumentation (2011)
- Baroni, Pietro; Cerutti, Federico; Giacomin, Massimiliano; Guida, Giovanni: Encompassing attacks to attacks in abstract argumentation frameworks (2009)
- Boella, Guido; Gabbay, Dov M.; van der Torre, Leendert; Villata, Serena: Meta-argumentation modelling. I: Methodology and techniques (2009)
- Gabbay, Dov M.: Semantics for higher level attacks in extended argumentation frames. I: Overview (2009)