%0 Book Section %1 Ulbricht2022-if %A Ulbricht, Markus %A Wallner, Johannes P %B Computational Models of Argument %D 2022 %I IOS Press %K topic_knowledge %T Strongly accepting subframeworks: Connecting abstract and structured Argumentation %X Computational argumentation is primed to strengthen the current hot research field of Explainable Artificial Intelligence (XAI), e.g., by dialectical approaches. In this paper, we extend and discuss a recently proposed approach of so-called strong acceptance on abstract argumentation that aims to support explaining argumentative acceptance. Our goal is to push these results into the realm of structured argumentation. In this setting, a knowledge base induces an abstract argumentation framework (AF) via instantiation. We investigate how and under which conditions it is possible to transfer results regarding strong acceptance between the given knowledge base and the induced AF. To this end we consider generic functions formalizing the interaction of the AF and the knowledge base. This approach helps us to infer rather general results making basic assumptions rather than dealing with the technical details of several structured argumentation formalisms. Along the way, we apply our techniques to the concrete approach of assumption-based argumentation (ABA) which constitutes one of the primal structured argumentation formalisms.

@incollection{Ulbricht2022-if, abstract = {Computational argumentation is primed to strengthen the current hot research field of Explainable Artificial Intelligence (XAI), e.g., by dialectical approaches. In this paper, we extend and discuss a recently proposed approach of so-called strong acceptance on abstract argumentation that aims to support explaining argumentative acceptance. Our goal is to push these results into the realm of structured argumentation. In this setting, a knowledge base induces an abstract argumentation framework (AF) via instantiation. We investigate how and under which conditions it is possible to transfer results regarding strong acceptance between the given knowledge base and the induced AF. To this end we consider generic functions formalizing the interaction of the AF and the knowledge base. This approach helps us to infer rather general results making basic assumptions rather than dealing with the technical details of several structured argumentation formalisms. Along the way, we apply our techniques to the concrete approach of assumption-based argumentation (ABA) which constitutes one of the primal structured argumentation formalisms.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Ulbricht, Markus and Wallner, Johannes P}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/27ff2d24a10e29498e5f84d026891c028/scadsfct}, booktitle = {Computational Models of Argument}, interhash = {af86fe5e306f7df132f56b3a4b9a6d0b}, intrahash = {7ff2d24a10e29498e5f84d026891c028}, keywords = {topic_knowledge}, month = sep, publisher = {IOS Press}, series = {Frontiers in artificial intelligence and applications}, timestamp = {2024-11-28T17:41:07.000+0100}, title = {Strongly accepting subframeworks: Connecting abstract and structured Argumentation}, year = 2022 }