Grounded semantics and infinitary argumentation frameworks

Martin Caminada, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 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 languageEnglish
Title of host publicationBNAIC 2014
Subtitle of host publicationProceedings of the 26th Benelux Conference on Artificial Intelligence
EditorsFranc Grootjen, Maria Otworowska, Johan Kwisthout
Pages25-32
Number of pages8
Publication statusPublished - Oct 2014

Fingerprint

Argumentation
Defeaters
Landmarks

Cite this

Caminada, M., & Oren, N. (2014). Grounded semantics and infinitary argumentation frameworks. In F. Grootjen, M. Otworowska, & J. Kwisthout (Eds.), BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence (pp. 25-32)

Grounded semantics and infinitary argumentation frameworks. / Caminada, Martin; Oren, Nir.

BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence. ed. / Franc Grootjen; Maria Otworowska; Johan Kwisthout. 2014. p. 25-32.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Caminada, M & Oren, N 2014, Grounded semantics and infinitary argumentation frameworks. in F Grootjen, M Otworowska & J Kwisthout (eds), BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence. pp. 25-32.
Caminada M, Oren N. Grounded semantics and infinitary argumentation frameworks. In Grootjen F, Otworowska M, Kwisthout J, editors, BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence. 2014. p. 25-32
Caminada, Martin ; Oren, Nir. / Grounded semantics and infinitary argumentation frameworks. BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence. editor / Franc Grootjen ; Maria Otworowska ; Johan Kwisthout. 2014. pp. 25-32
@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’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 = "10",
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 - Conference contribution

SP - 25

EP - 32

BT - BNAIC 2014

A2 - Grootjen, Franc

A2 - Otworowska, Maria

A2 - Kwisthout, Johan

ER -