After successful completion of the course, students are able to...

• use formal methods from the area of parameterized complexity
• and apply them in practice doing concrete implementations
• apply SAT tools in practice

In this seminar, we discuss algorithmic graph theory and the use of its methods for the problems in the fields of boolean satisfiability (SAT), databases, and answer set programming (ASP). We focus on the design and implementation of parameterized algorithms in this area.

Design, implementation, and presentation of a parameterized algorithm.

ECTS Breakdown:

• 10h introduction to subject matter
• 30h algorithm design and implementation, 
• 25h presentation (including time to prepare)

Assessement is based on the implementation and the oral presenation.