The aim of this course is to give an introduction to the field of abstract argumentation.
It will provides an overview of semantics for abstract argumentation and their (computational) properties.
The course adresses advanced students in knowledge representation (see prerequisites).

Didactic approach:

The course consists of both a lecture part, where the appropriate concepts will be presented, and a practical part.
In the latter, students (in cooperation with a lecturer) are supposed to work
out some theoretical results OR / AND  breaking down such results to practice by respective implementations.

Prerequisites:

1. Basic complexity theory:
   185.291 4.0 VU Formal Methods in Computer Science OR
   181.142 2.0 VU Complexity Theory OR
   184.215 2.0 VU Complexity Analysis
2. SAT-Solving OR Answer Set Programming (ASP):
   184.090 2.0 VU SAT Solving OR
   184.143 2.0 VL Logic-oriented Programming OR
   184.176 1.0 LU Introduction to Knowledge-based Systems

+ lecture part:
    - Dungs Abstract Argumentation Frameworks
    - Semantics for abstract argumentation
    - Properties and Complexity of argumentation
    - Algorithms and ASP / (Q)SAT Encodings
    - Generalizations of Dungs Abstract Argumentation Frameworks

+ practical part:
    - Application of the concepts and techniques presented in the lecture

elaboration of the practical part & exam at the end of the course