Chapter 3

Existing Approaches for Computing Argumentation Semantics

Abstract

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.

Keywords

answer set programming; direct apporach; labelling-based algorithms; reduction approach; semantics computation

3.1 Introduction

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

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

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.