Grounded semantics and infinitary argumentation frameworks

Martin Caminada, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

12 Citations (Scopus)
6 Downloads (Pure)


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
Number of pages8
Publication statusPublished - Oct 2014


Dive into the research topics of 'Grounded semantics and infinitary argumentation frameworks'. Together they form a unique fingerprint.

Cite this