Postulates for logic-based argumentation systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Approximate Reasoning Année : 2014

Postulates for logic-based argumentation systems

Résumé

Logic-based argumentation systems are developed for reasoning with inconsistent information. Starting from a knowledge base encoded in a logical language, they define arguments and attacks between them using the consequence operator associated with the language. Finally, a semantics is used for evaluating the arguments. In this paper, we focus on systems that are based on deductive logics and that use Dung's semantics. We investigate rationality postulates that such systems should satisfy. We define five intuitive postulates: consistency and closure under the consequence operator of the underlying logic of the set of conclusions of arguments of each extension, closure under sub-arguments and exhaustiveness of the extensions, and a free precedence postulate ensuring that the free formulas of the knowledge base (i.e., the ones that are not involved in inconsistency) are conclusions of arguments in every extension. We study the links between the postulates and explore conditions under which they are guaranteed or violated.
Fichier principal
Vignette du fichier
Amgoud_12526.pdf (725.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01123709 , version 1 (05-03-2015)

Identifiants

Citer

Leila Amgoud. Postulates for logic-based argumentation systems. International Journal of Approximate Reasoning, 2014, vol. 55 (n° 9), pp. 2028-2048. ⟨10.1016/j.ijar.2013.10.004⟩. ⟨hal-01123709⟩
83 Consultations
161 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More