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 4

Sub-Frameworks and Local Semantics

Abstract

In many situations, evaluating the status of arguments globally is inefficient. In this chapter, we introduce a basic theory for evaluating the status of arguments locally: given a subset of arguments, their status is computed in a sub-framework which may (or may not) be conditioned by other sub-frameworks. For an unconditioned sub-framework, the definition of its semantics is the same as the one for Dung’s argumentation framework. On the contrary, for a conditioned sub-framework in which the status of some arguments may be affected by that of some external arguments, the definition of its semantics is different.

Keywords

conditioned sub-frameworks; induced sub-graphs; local semantics; partially ...

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