PLEASE NOTE: changed date and time of preliminary meeting!
The aim of the course is to make the participants familiar with recent progress in the design of discrete algorithms and computational complexity that applies to problems from various areas of computational reasoning. Special focus lies on the application of methods from parameterized complexity.
The didactic approach of this course is based on a combination of a lecture part and a practice part. In the lecture part new concepts are presented by the course leader. In the practice part, participants work independently on reading material and exercises and present their results in class. This is an advanced course that requires basic knowledge in complexity theory.
First lecture and introduction will take place on Tuesday 25 March 2014, Seminar Room Gödel, at 5pm (sharp).
New concepts and results in algorithm design and computational complexity that apply to problems from various areas of computational reasoning, including the following: SAT (propositional satisfiability), CSP (constraint satisfaction), Nonmonotonic Reasoning, Argumentation, Bayesian Reasoning and Structure Learning.
Special focus lies on the application of methods from parameterized complexity such as bounded search trees, decompositions, reductions to problem kernels, and fixed-parameter intractability.
This course requires basic knowledge in complexity theory. It is assumed that participants have completed at least of the following courses, or an equivalent course.
185.291 4.0 VU Formal Methods in Computer Science
181.142 2.0 VU Complexity Theory
184.215 2.0 VU Complexity Analysis
The following courses are recommended:
184.090 2.0 VU SAT Solving
184.143 2.0 VL Logic-oriented Programming
184.176 1.0 LU Introduction to Knowledge-based Systems
186.145 2.0 VU Algorithms on Graphs
