On Computing Explanations in Argumentation
From International Center for Computational Logic
On Computing Explanations in Argumentation
Thesis defence by Satyadharma Tirtarasa
- Location: APB 3105
- Start: 4. February 2016 at 1:40 pm
- End: 4. February 2016 at 2:40 pm
- Research group: 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.
