Approximating weakly preferred semantics in abstract argumentation through vacuous reduct semantics
Article No.: 11, Pages 107 - 116
Abstract
We consider the recently introduced vacuous reduct semantics in abstract argumentation that allows the composition of arbitrary argumentation semantics through the notion of the reduct. We show that by recursively applying the vacuous reduct scheme we are able to cover a broad range of semantical approaches. Our main result shows that we can recover the weakly preferred semantics as the unique solution of a fixed point equation involving an infinite application of the vacuous reduct semantics based only on the very simple property of conflict-freeness. We also conduct an extensive study of the computational complexity of the recursive application of vacuous reduct semantics, which shows that it completely covers each level of the polynomial hierarchy, depending on the recursion depth.
References
[1]
Baroni, P., and Giacomin, M. 2007. On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. 171(10-15):675-700.
[2]
Baroni, P.; Caminada, M.; and Giacomin, M. 2011. An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4):365-410.
[3]
Baroni, P.; Giacomin, M.; and Guida, G. 2005. Sccrecursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1-2):162-210.
[4]
Baumann, R.; Brewka, G.; and Ulbricht, M. 2020a. Revisiting the foundations of abstract argumentation: Semantics based on weak admissibility and weak defense. In Proc. AAAI 2020, 2742-2749. AAAI Press.
[5]
Baumann, R.; Brewka, G.; and Ulbricht, M. 2020b. Comparing weak admissibility semantics to their dung-style counterparts - reduct, modularization, and strong equivalence in abstract argumentation. In Proc. KR 2020, September 12-18, 2020, 79-88.
[6]
Black, E.; Maudet, N.; and Parsons, S. 2021. Argumentation-based dialogue. In Handbook of Formal Argumentation, Volume 2. College Publications. 511.
[7]
Bl�mel, L., and Ulbricht, M. 2022. Defining defense and defeat in abstract argumentation from scratch - A generalizing approach. In Kern-Isberner, G.; Lakemeyer, G.; and Meyer, T., eds., Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel. July 31 - August 5, 2022.
[8]
Bodanza, G. A., and Tohm�, F. A. 2009. Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack. J. Appl. Log. 7(4):403-420.
[9]
Cramer, M., and van der Torre, L. 2019. SCF2 - an argumentation semantics for rational human judgments on argument acceptability. In Beierle, C.; Ragni, M.; Stolzenburg, F.; and Thimm, M., eds., Proceedings of the 8th Workshop on Dynamics of Knowledge and Belief (DKB-2019) and the 7th Workshop KI & Kognition (KIK-2019) co-located with 44nd German Conference on Artificial Intelligence (KI 2019), Kassel, Germany, September 23, 2019, volume 2445 of CEUR Workshop Proceedings, 24-35. CEUR-WS.org.
[10]
Dondio, P., and Longo, L. 2021. Weakly complete semantics based on undecidedness blocking. CoRR abs/2103.10701.
[11]
Doutre, S., and Mailly, J. 2018. Constraints and changes: A survey of abstract argumentation dynamics. Argument Comput. 9(3):223-248.
[12]
Dung, P. M. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2):321-357.
[13]
Dvor�k, W., and Dunne, P. E. 2018. Computational problems in formal argumentation and their complexity. In Handbook of Formal Argumentation. College Publications.
[14]
Dvor�k, W.; Rienstra, T.; van der Torre, L.; and Woltran, S. 2022. Non-admissibility in abstract argumentation. In Toni, F.; Polberg, S.; Booth, R.; Caminada, M.; and Kido, H., eds., Computational Models of Argument - Proceedings of COMMA 2022, Cardiff, Wales, UK, 14-16 September 2022, volume 353 of Frontiers in Artificial Intelligence and Applications, 128-139. IOS Press.
[15]
Dvor�k, W.; Ulbricht, M.; and Woltran, S. 2021. Recursion in abstract argumentation is hard - on the complexity of semantics based on weak admissibility. In Proc AAAI 2021, 6288-6295. AAAI Press.
[16]
Ferretti, E.; Tamargo, L. H.; Garc�a, A. J.; Errecalde, M. L.; and Simari, G. R. 2017. An approach to decision making based on dynamic argumentation systems. Artif. Intell. 242:107-131.
[17]
Governatori, G.; Maher, M. J.; and Olivieri, F. 2021. Strategic argumentation. FLAP 8(6):1679-1748.
[18]
Hunter, A.; Polberg, S.; Potyka, N.; Rienstra, T.; and Thimm, M. 2021. Probabilistic argumentation: A survey. Handbook of Formal Argumentation 2:397-441.
[19]
Niskanen, A.; Neugebauer, D.; J�rvisalo, M.; and Rothe, J. 2020. Deciding acceptance in incomplete argumentation frameworks. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, 2942-2949. AAAI Press.
[20]
Potyka, N. 2019. Open-mindedness of gradual argumentation semantics. In Amor, N. B.; Quost, B.; and Theobald, M., eds., Scalable Uncertainty Management - 13th International Conference, SUM 2019, Compiegne, France, December 16-18, 2019, Proceedings, volume 11940 of Lecture Notes in Computer Science, 236-249. Springer.
[21]
Thimm, M. 2014. Strategic argumentation in multi-agent systems. K�nstliche Intell. 28(3):159-168.
[22]
Thimm, M. 2023. On undisputed sets in abstract argumentation. In Proc. AAAI 2023, TBA. AAAI Press.
Recommendations
Enhancing dung's preferred semantics
FoIKS'10: Proceedings of the 6th international conference on Foundations of Information and Knowledge SystemsConflict resolution is an important issue. Dung's preferred semantics is a promising approach to resolving conflicts. However, such semantics is not capable of dealing with conflicts satisfactorily in the argumentation frameworks wherein there exists ...
Abstract operational semantics for use case maps
FORTE'05: Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed SystemsScenario-driven requirement specifications are widely used to capture and represent functional requirements. Use Case Maps (UCM) is being standardized as part of the User Requirements Notation (URN), the most recent addition to ITU–T’s family of ...
Enhancing Dung's Preferred Semantics
FoIKS 2010: Proceedings of the 6th International Symposium on Foundations of Information and Knowledge Systems - Volume 5956Conflict resolution is an important issue. Dung's preferred semantics is a promising approach to resolving conflicts. However, such semantics is not capable of dealing with conflicts satisfactorily in the argumentation frameworks wherein there exists ...
Comments
Information & Contributors
Information
Published In
September 2023
778 pages
ISBN:978-1-956792-02-7
Copyright � 2023 International Joint Conferences on Artificial Intelligence Organization.
Sponsors
- Principles of Knowledge Representation and Reasoning, Incorporated (KR, Inc.)
- Artificial Intelligence Journal
- National Science Foundation
- Association for Logic Programming
- School of Embedded Composite Artificial Intelligence
Publisher
Unknown publishers
Publication History
Published: 02 September 2023
Qualifiers
- Research-article
- Research
- Refereed limited
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024