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

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 |