An Approach for Static Argumentation Frameworks
Abstract
Currently, except some classes of argumentation frameworks (with special topologies or fixed parameters, such as acyclic, symmetric, and bounded tree-width, etc.) that have been clearly identified as tractable, for a generic argumentation framework, how to efficiently compute its semantics is still a challenging problem. Based on fundamental theories presented in the previous two chapters, in this chapter, we first propose a decomposition-based approach, and then conduct an empirical investigation. Given a generic argumentation framework, it is firstly decomposed into a set of sub-frameworks that are located in a number of layers. Then, the semantics of an argumentation framework ...
Get Efficient Computation of Argumentation Semantics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
