Reference : Extended Explanatory Argumentation Frameworks
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/32410
Extended Explanatory Argumentation Frameworks
English
Dauphin, Jérémie mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Cramer, Marcos mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2018
Theory and Applications of Formal Argumentation
Yes
The 2017 International Workshop on Theory and Applications of Formal Argument
19-20 August 2017
[en] Multiple extensions of Dung's argumentation frameworks (AFs) have been proposed in order to model features of argumentation that cannot be directly modeled in AFs. One technique that has already previously proven useful to study and combine such extensions is the meta-argumentation methodology involving the notion of a flattening. In order to faithfully model the interaction between explanation argumentation in scientific debates, Šešelja and Straßer have introduced Explanatory Argumentation Frameworks (EAFs). In this paper, we first prove that the flattening technique works as expected for recursive (higher-order) attacks. Then we apply this technique in order to combine EAFs with multiple other extensions that have been proposed to AFs, namely with recursive attacks, joint attacks and a support relation between arguments. This gives rise to Extended Explanatory Argumentation Frameworks (EEAFs). We illustrate the applicability of EEAFs by using them to model a piece of argumentation from a research-level philosophy book.
http://hdl.handle.net/10993/32410

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
EEAFs.pdfAuthor postprint411.72 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.