Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

KR

2004

Springer

2004

Springer

We consider Dung’s argumentation framework, in which an argument system consists of a set of arguments and a binary relation between arguments representing the notion of a conﬂict. The semantics given by Dung deﬁne (with respect to each argument system) acceptable sets of arguments called extensions. For his so-called stable semantics, Dung also gives an alternative deﬁnition in terms of an equation that a set satisﬁes if and only if that set is a stable extension. However, neither the original deﬁnition nor the equation reﬂect the fact that the stable semantics (similarly to all of Dung’s semantics) rely upon the notion of an admissible set. Moreover, none of Dung’s other semantics have been characterized by such an equation. Our ﬁrst goal is to provide such characterizations for the other semantics: We capture Dung’s semantics by means of equations that a set satisﬁes if and only if it is an extension under the semantics at hand. Not only do we give such equa...

Related Content

Added |
02 Jul 2010 |

Updated |
02 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
KR |

Authors |
Philippe Besnard, Sylvie Doutre |

Comments (0)