Abstract
In this paper, we propose solid admissibility that is a strengthened version of Dung’s admissibility to obtain the most acceptable set of arguments. Besides, other solid extensions based on solid admissibility are defined. Such extensions not only include all defenders of its elements but also exclude all arguments indirectly attacked and indirectly defended by some argument(s). Furthermore, we characterize solid extensions with propositional formulas. Using these formulas, we aggregate solid extensions by using approaches from judgment aggregation. Especially, although no quota rule preserves Dung’s admissibility for any argumentation framework, we show that there exist quota rules that preserve solid admissibility for any argumentation framework.
Supported by the China Postdoctoral Science Foundation Grant, No. 2019M663352.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Amgoud, L., Ben-Naim, J.: Ranking-based semantics for argumentation frameworks. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 134–147. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40381-1_11
Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. 171(10–15), 675–700 (2007)
Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1–2), 162–210 (2005)
Baumann, R., Brewka, G., Ulbricht, M.: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 2742–2749 (2020)
Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: NMR, vol. 4, pp. 59–64. Citeseer (2004)
Bodanza, G.A., Tohmé, F.A.: Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack. J. Appl. Log. 7(4), 403–420 (2009)
Cayrol, C., Lagasquie-Schiex, M.C.: Graduality in argumentation. J. Artif. Intell. Res. 23, 245–297 (2005)
Chen, W.: Preservation of admissibility with rationality and feasibility constraints. In: Dastani, M., Dong, H., van der Torre, L. (eds.) CLAR 2020. LNCS (LNAI), vol. 12061, pp. 245–258. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-44638-3_15
Chen, W.: Guaranteeing admissibility of abstract argumentation frameworks with rationality and feasibility constraints. J. Log. Comput. (2021, forthcoming)
Chen, W., Endriss, U.: Aggregating alternative extensions of abstract argumentation frameworks: preservation results for quota rules. In: COMMA, pp. 425–436 (2018)
Coste-Marquis, S., Devred, C., Marquis, P.: Prudent semantics for argumentation frameworks. In: 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), pp. 568–572. IEEE (2005)
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–357 (1995)
Grandi, U., Endriss, U.: Lifting integrity constraints in binary aggregation. Artif. Intell. 199, 45–66 (2013)
Grossi, D., Modgil, S.: On the graded acceptability of arguments in abstract and instantiated argumentation. Artif. Intell. 275, 138–173 (2019)
Jakobovits, H., Vermeir, D.: Robust semantics for argumentation frameworks. J. Log. Comput. 9(2), 215–261 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, X., Chen, W. (2021). Solid Semantics for Abstract Argumentation Frameworks and the Preservation of Solid Semantic Properties. In: Rosenfeld, A., Talmon, N. (eds) Multi-Agent Systems. EUMAS 2021. Lecture Notes in Computer Science(), vol 12802. Springer, Cham. https://doi.org/10.1007/978-3-030-82254-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-82254-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-82253-8
Online ISBN: 978-3-030-82254-5
eBook Packages: Computer ScienceComputer Science (R0)