December 2013
Intermediate to advanced
148 pages
3h 51m
English
In this chapter, we introduce two existing approaches for computing argumentation semantics. One is a reduction approach, based on answer set programming, the other is a direct approach, called labelling-based algorithms. These two approaches will be used in the empirical studies of the efficient approaches for computing the semantics of argumentation.
answer set programming; direct apporach; labelling-based algorithms; reduction approach; semantics computation
Given an argumentation framework, an important problem is to determine the status of arguments, i.e., to compute the extensions or labellings of the argumentation framework. In recent ...
Read now
Unlock full access