Use this URL to cite or link to this record in EThOS:
Title: Set- and graph-theoretic investigations in abstract argumentation
Author: Spanring, C.
ISNI:       0000 0004 7428 4317
Awarding Body: University of Liverpool
Current Institution: University of Liverpool
Date of Award: 2017
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract argumentation roots to similar parts in philosophy, linguistics and artificial intelligence. The core (syntactic) notions of argument and attack are commonly visualized via digraphs, as nodes and directed edges, respectively. Semantic evaluation functions then provide a meaning of acceptance (i.e. acceptable sets of arguments also called extensions) for any such abstract argumentation structure. In this thesis, for the very first time, we tackle the questions of acceptance and conflict from a graph- and set-theoretic point of view. We elaborate on the interspace between syntactic conflict/independence (defined by attack structure) and their semantic counterparts (defined by joint acceptance of arguments). Graph theory regards the filters and techniques we use to, respectively, categorize and describe abstract argumentation structures. Set theory regards the issues we have to deal with particularly for non-finite argument sets. For argumentation in the arbitrarily infinite case this thesis can and should be seen as reference work. For the matter of conflicts in abstract argumentation we further provide a solid base and formal framework for future research. All in all, this is a mathematicians view on abstract argumentation, deepening the field of conception and widening the angle of applicability.
Supervisor: Dunne, P. E. ; Grossi, D. ; Woltran, S. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral