A formal analysis of logic-based argumentation systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A formal analysis of logic-based argumentation systems

Résumé

Dung’s abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined for evaluating the arguments. What is worth noticing is that the model completely abstracts from the applications to which it can be applied. Thus, it is not clear what are the results that can be returned in a given application by each semantics. This paper answers this question. For that purpose, we start by plunging the model in a real application. That is, we assume that we have an inconsistent knowledge base (KB) containing formulas of an abstract monotonic logic. From this base, we show how to define arguments. Then, we characterize the different semantics in terms of the subsets of the KB that are returned by each extension. We show a full correspondence between maximal consistent subbases of a KB and maximal conflict-free sets of arguments. We show also that stable and preferred extensions choose randomly some consistent subbases of a base. Finally, we investigate the results of three argumentation systems that use well-known attack relations.

Dates et versions

hal-04313448 , version 1 (29-11-2023)

Identifiants

Citer

Leila Amgoud, Philippe Besnard. A formal analysis of logic-based argumentation systems. 4th International Conference on Scalable Uncertainty Management (SUM 2010), Sep 2010, Toulouse, France. pp.42--55, ⟨10.1007/978-3-642-15951-0_10⟩. ⟨hal-04313448⟩
7 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More