Toward a More Efficient Generation of Structured Argumentation Graphs - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Toward a More Efficient Generation of Structured Argumentation Graphs

Bruno Yun
Srdjan Vesic
Madalina Croitoru

Résumé

To address the needs of the EU NoAW project, in this paper we solve the problem of efficiently generating the argumentation graphs from knowledge bases expressed using existential rules. For the knowledge bases without rules, we provide a methodology that allows to optimise the generation of argumentation graphs. For knowledge bases with rules, we show how to filter out a large number of arguments and reduce the number of attacks.
Fichier principal
Vignette du fichier
FAIA305-0205.pdf (254.3 Ko) Télécharger le fichier
Loading...

Dates et versions

lirmm-01892707 , version 1 (10-10-2018)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Bruno Yun, Srdjan Vesic, Madalina Croitoru. Toward a More Efficient Generation of Structured Argumentation Graphs. COMMA 2018 - 7th International Conference on Computational Models of Argument, Sep 2018, Varsovie, Poland. pp.205-212, ⟨10.3233/978-1-61499-906-5-205⟩. ⟨lirmm-01892707⟩
85 Consultations
154 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More