Doctor's Theses (authored and supervised):
"Realising argumentation using answer set programming and quantified boolean formulas";
Supervisor, Reviewer: S. Woltran, U. Egly;
Institute of Logic and Computations,
oral examination: 2019-04-30.
Argumentation is one of the key manners in which humans individually and collectively make sense of complex scenarios about which the information that is available is incomplete or even inconsistent. Computational or artificial argumentation is thus also an increasingly important sub-field of AI aiming at supporting or even automating human argumentation as well as enhancing computational systems with means of generating and evaluating arguments. This work is concerned with the implementation of general formal models underlying computational argumentation systems.
rgumentation / abstract dialectical frameworks / defeasible theories / quantified boolean formulas / answer set programming / complexity sensitive encodings / implementations
Created from the Publication Database of the Vienna University of Technology.