Abstract
In view of the plethora of different argumentation semantics, we consider the question what the essential properties of a “reasonable” semantics are. We discuss three attempts of such a characterization, based on computational complexity, logical expressivity and invariance under partial duplication, which are satisfied by most, if not all, known semantics. We then challenge each of these proposals by exhibiting plausible semantics which still not satisfy our criteria, demonstrating the difficulty of our endeavor.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Amgoud, L., Cayrol, C., Lagasquie, M.-C., Livet, P.: On bipolarity in argumentation frameworks. Int. Journal of Intelligent Systems 23, 1–32 (2008)
Amgoud, L., Vesic, S.: Repairing preference-based argumentation frameworks. In: Proc. IJCAI 2009, pp. 665–670 (2009)
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Eng. Review 26(4), 365–410 (2011)
Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. 171(10-15), 675–700 (2007)
Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429–448 (2003)
Brewka, G., Polberg, S., Woltran, S.: Generalizations of dung frameworks and their role in formal argumentation. IEEE Intel. Sys. 29(1), 30–38 (2014)
Brewka, G., Woltran, S.: Abstract Dialectical Frameworks. In: Proc. KR 2010, pp. 102–111 (2010)
Büchi, R.J.: On a decision method in restricted second order arithmetic. In: Proc. Logic, Methodology and Philosophy of Science 1960, pp. 1–11 (1962)
Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artif. Intell. 171(5-6), 286–310 (2007)
Coste-Marquis, S., Devred, C., Marquis, P.: Symmetric argumentation frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 317–328. Springer, Heidelberg (2005)
Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theor. Comput. Sci. 170(1-2), 209–244 (1996)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)
Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell. 141(1/2), 187–203 (2002)
Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 85–104. Springer, US (2009)
Dvořák, W., Gaggl, S.A.: Stage semantics and the scc-recursive schema for argumentation semantics. J. Log. Comput. 2014 (2014)
Dvořák, W., Järvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53–78 (2014)
Dvořák, W., Szeider, S., Woltran, S.: Abstract argumentation via monadic second order logic. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds.) SUM 2012. LNCS, vol. 7520, pp. 85–98. Springer, Heidelberg (2012)
Egly, U., Gaggl, S., Woltran, S.: Answer-set programming encodings for argumentation frameworks. In Argument and Computation 1(2), 147–177 (2010)
Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence, pp. 105–132. Springer (2009)
Oikarinen, E., Woltran, S.: Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14-15), 1985–2009 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gaggl, S.A., Rudolph, S., Thomazo, M. (2015). What Is a Reasonable Argumentation Semantics?. In: Eiter, T., Strass, H., Truszczyński, M., Woltran, S. (eds) Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. Lecture Notes in Computer Science(), vol 9060. Springer, Cham. https://doi.org/10.1007/978-3-319-14726-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-14726-0_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14725-3
Online ISBN: 978-3-319-14726-0
eBook Packages: Computer ScienceComputer Science (R0)