December 2013
Intermediate to advanced
148 pages
3h 51m
English
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 ...
Read now
Unlock full access