Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Dialectical Proofs for Constrained Argumentation

Abstract :

Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of acceptability of arguments. These constraints are expressed by means of a logical formula which is added to Dung's framework. The resulting system captures several other extensions of Dung's original system. To determine if a set of arguments is credulously inferred from a CAF, the notion of dialectical proof (alternating pros and cons arguments) is extended for Dung's frameworks in order to respect the additional constraint. The new constrained dialectical proofs are computed by using Answer Set Programming.

Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-03255436
Contributeur : Okina Université d'Angers <>
Soumis le : mercredi 9 juin 2021 - 15:14:11
Dernière modification le : jeudi 10 juin 2021 - 03:48:18

Identifiants

Citation

Caroline Devred, Sylvie Doutre, Claire Lefèvre, Pascal Nicolas. Dialectical Proofs for Constrained Argumentation. 3rd International Conference on Computational Models of Argument, COMMA 2010, University of Brescia, Sep 2010, Desenzano del Garda, Italy. pp.159 - 170, ⟨10.3233/978-1-60750-619-5-159⟩. ⟨hal-03255436⟩

Partager

Métriques

Consultations de la notice

13