Chapter 4

Sub-Frameworks and Local Semantics


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.


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

Get Efficient Computation of Argumentation Semantics now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.