On Computing Explanations in Argumentation
Aus International Center for Computational Logic
On Computing Explanations in Argumentation
Verteidigung Studienarbeit von Satyadharma Tirtarasa
- Veranstaltungsort: APB 3105
- Beginn: 4. Februar 2016 um 13:40
- Ende: 4. Februar 2016 um 14:40
- Forschungsgruppe: Computational Logic
- Event series: KBS Seminar
- iCal
In an argumentation, usually there is a particular argument called as the topic. Related admissible is a new semantics extending admissible semantics to catch this aspect. This semantics will be defined in both abstract argumentation and assumption-based argumentation framework. There are several types of explanations regarding their size. The computation of these explanations is also given using dispute trees.
