{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T02:22:41Z","timestamp":1774146161924,"version":"3.50.1"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:p>Semantics based on weak admissibility were recently introduced to overcome a problem with self-defeating arguments that has not been solved for more than 25 years. The recursive definition of weak admissibility mainly relies on the notion of a reduct regarding a set E which only contains arguments which are neither in E, nor attacked by E. At first glance the reduct seems to be tailored for the weaker versions of Dung-style semantics only. In this paper we show that standard Dung semantics can be naturally reformulated using the reduct revealing that this concept is already implicit. We further identify a new abstract principle for semantics, so-called modularization describing how to obtain further extensions given an initial one. Its importance for the study of abstract argumentation semantics is shown by its ability to alternatively characterize classical and non-classical semantics. Moreover, we tackle the notion of strong equivalence via characterizing kernels and give a complete classification of the weak versions regarding well-known properties and postulates known from the literature.<\/jats:p>","DOI":"10.24963\/kr.2020\/9","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T04:39:16Z","timestamp":1597898356000},"page":"79-88","source":"Crossref","is-referenced-by-count":6,"title":["Comparing Weak Admissibility Semantics to their Dung-style Counterparts -- Reduct, Modularization, and Strong Equivalence in Abstract Argumentation"],"prefix":"10.24963","author":[{"given":"Ringo","family":"Baumann","sequence":"first","affiliation":[{"name":"Leipzig University"}]},{"given":"Gerhard","family":"Brewka","sequence":"additional","affiliation":[{"name":"Leipzig University"}]},{"given":"Markus","family":"Ulbricht","sequence":"additional","affiliation":[{"name":"Leipzig University"}]}],"member":"10584","event":{"name":"17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}","theme":"Artificial Intelligence","location":"Rhodes, Greece","acronym":"KR-2020","number":"17","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Association for Logic Programming","Center for Perspicuous Computing","European Association for Artificial Intelligence","Ontopic - The Virtual Knowledge Graph Company"],"start":{"date-parts":[[2020,9,12]]},"end":{"date-parts":[[2020,9,18]]}},"container-title":["Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T21:18:30Z","timestamp":1604611110000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2020\/9"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2020\/9","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}