O'Reilly logo

Efficient Computation of Argumentation Semantics by Beishui Liao

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 6

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 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required