### Abstract

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 |

### Fingerprint

### Cite this

*BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence*(pp. 25-32)

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

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

*BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence.*pp. 25-32.

}

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 -