The aim of the course is to analyze and present scientific work in the area of theoretical computer science. In particular, we will study advanced algorithms with focus on Propositional Satisfiability and Answer Set Programming.
The subject of the course is abstract solvers, i.e. a formal way for describing solving algorithms.
Course-Webpage: http://www.star.dist.unige.it/~marco/SemTCS
54 h Preparation: Reading selected research articles or book chapters 21 h Discussion of the research articles or book chapters (14 classes) --------------------------------------------------------------------------------
75 h = 3 Ects
Not necessary