Grounded semantics and infinitary argumentation frameworks

Martin Caminada; Nir Oren

Grounded semantics and infinitary argumentation frameworks

Martin Caminada, Nir Oren

Computing Science

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

12 Citations (Scopus)

6 Downloads (Pure)

Abstract

Computing the grounded extension of an argumentation framework can be done using the well-known inductive procedure of Dung’s landmark paper. However, this procedure has only been proven to be correct for finitary argumentation frameworks, that is, frameworks in which every argument has only a finite number of defeaters. The problem is that formalisms like ASPIC+ and ASPIC- can
easily generate frameworks in which arguments have an infinite number of defeaters. In the current paper, we will therefore broaden the applicability of the proof procedures for grounded semantics, and weaken the condition that the argumentation framework has to be finitary.

Original language	English
Title of host publication	BNAIC 2014
Subtitle of host publication	Proceedings of the 26th Benelux Conference on Artificial Intelligence
Editors	Franc Grootjen, Maria Otworowska, Johan Kwisthout
Pages	25-32
Number of pages	8
Publication status	Published - Oct 2014

Cite this

@inproceedings{ccebe52a609147ff947733cb02357335,

title = "Grounded semantics and infinitary argumentation frameworks",

abstract = "Computing the grounded extension of an argumentation framework can be done using the well-known inductive procedure of Dung{\textquoteright}s landmark paper. However, this procedure has only been proven to be correct for finitary argumentation frameworks, that is, frameworks in which every argument has only a finite number of defeaters. The problem is that formalisms like ASPIC+ and ASPIC- caneasily generate frameworks in which arguments have an infinite number of defeaters. In the current paper, we will therefore broaden the applicability of the proof procedures for grounded semantics, and weaken the condition that the argumentation framework has to be finitary.",

author = "Martin Caminada and Nir Oren",

year = "2014",

month = oct,

language = "English",

pages = "25--32",

editor = "Franc Grootjen and Maria Otworowska and Johan Kwisthout",

booktitle = "BNAIC 2014",

}

TY - GEN

T1 - Grounded semantics and infinitary argumentation frameworks

AU - Caminada, Martin

AU - Oren, Nir

PY - 2014/10

Y1 - 2014/10

N2 - Computing the grounded extension of an argumentation framework can be done using the well-known inductive procedure of Dung’s landmark paper. However, this procedure has only been proven to be correct for finitary argumentation frameworks, that is, frameworks in which every argument has only a finite number of defeaters. The problem is that formalisms like ASPIC+ and ASPIC- caneasily generate frameworks in which arguments have an infinite number of defeaters. In the current paper, we will therefore broaden the applicability of the proof procedures for grounded semantics, and weaken the condition that the argumentation framework has to be finitary.

AB - Computing the grounded extension of an argumentation framework can be done using the well-known inductive procedure of Dung’s landmark paper. However, this procedure has only been proven to be correct for finitary argumentation frameworks, that is, frameworks in which every argument has only a finite number of defeaters. The problem is that formalisms like ASPIC+ and ASPIC- caneasily generate frameworks in which arguments have an infinite number of defeaters. In the current paper, we will therefore broaden the applicability of the proof procedures for grounded semantics, and weaken the condition that the argumentation framework has to be finitary.

M3 - Published conference contribution

SP - 25

EP - 32

BT - BNAIC 2014

A2 - Grootjen, Franc

A2 - Otworowska, Maria

A2 - Kwisthout, Johan

ER -

Grounded semantics and infinitary argumentation frameworks

Abstract

Fingerprint

Cite this