Abstract
In the traditional definition of Dung’s abstract argumentation framework (\(\ensuremath{AF}\)), the notion of attack is understood as a relation between arguments, thus bounding attacks to start from and be directed to arguments. This paper introduces a generalized definition of abstract argumentation framework called \(\ensuremath{AFRA}\) (Argumentation Framework with Recursive Attacks), where an attack is allowed to be directed towards another attack. From a conceptual point of view, we claim that this generalization supports a straightforward representation of reasoning situations which are not easily accommodated within the traditional framework. From the technical side, we first investigate the extension to the generalized framework of the basic notions of conflict-free set, acceptable argument, admissible set and of Dung’s fundamental lemma. Then we propose a correspondence from the \(\ensuremath{AFRA}\) to the \(\ensuremath{AF}\) formalism, showing that it satisfies some basic desirable properties. Finally we analyze the relationships between \(\ensuremath{AFRA}\) and a similar extension of Dung’s abstract argumentation framework, called \(\ensuremath{EAF+}\) and derived from the recently proposed formalism \(\ensuremath{EAF}\).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77(2), 321–357 (1995)
Bench-Capon, T.J.M.: Persuasion in practical argument using value based argumentation frameworks. Journal of Logic and Computation 13(3), 429–448 (2003)
Amgoud, L., Cayrol, C., Lagasquie-Schiex, M.C., Livet, P.: On bipolarity in argumentation frameworks. Int. Journal of Intelligent Systems 23, 1062–1093 (2008)
Modgil, S.: An abstract theory of argumentation that accommodates defeasible reasoning about preferences. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS, vol. 4724, pp. 648–659. Springer, Heidelberg (2007)
Bench-Capon, T.J.M., Mogdil, S.: Integrating object and meta-level value based argumentation. In: Proc. 2nd Int. Conf. on Computational Models of Argument (COMMA 2008), Toulouse, F, pp. 240–251 (2008)
Modgil, S.: Reasoning about preferences in argumentation frameworks. Artificial Intelligenc (in press, 2009)
Barringer, H., Gabbay, D.M., Woods, J.: Temporal dynamics of support and attack networks: From argumentation to zoology. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS, vol. 2605, pp. 59–98. Springer, Heidelberg (2005)
Boella, G., van der Torre, L., Villata, S.: Social viewpoints for arguing about coalitions. In: Proc. 11th Pacific Rim Int. Conf. on Multi-Agents (PRIMA 2008), pp. 66–77 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baroni, P., Cerutti, F., Giacomin, M., Guida, G. (2009). Encompassing Attacks to Attacks in Abstract Argumentation Frameworks. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02906-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02905-9
Online ISBN: 978-3-642-02906-6
eBook Packages: Computer ScienceComputer Science (R0)