Topic outline

  • General

    The Spring 2019 edition of the course starts on the 25th of February by the first lecture in the Hall T2 of CS Building, at 12 o'clock. Please see the slides of Practical Arrangements (to be linked below) for the formal course requirements and grading principles. The materials for each round can be found in the corresponding chapter in the "Online exercises" page.

    The tentative schedule for the course is as follows:

    1.  February 25: Practical Arrangements and Introduction [Practical Arrangements slides]
    2.  March 4: Premises for Modern SAT Solving
    3. March 11: Constraint Programming
    4. March 18: Binary Decision Diagrams
    5. March 25: Advanced Normal Forms
    6. April 1: Answer Set Programming
    7. April 15: Answer Set Programming: Advanced Topics
    8. April 29: Satisfiability Modulo Theories I
    9. May 6: Satisfiability Modulo Theories II
    10. May 13: Satisfiability Modulo Theories III

    If you need help for the online exercises of the course, please attend exercise sessions which are typically organized on Wednesdays 14:15-16:00 in the computer room T7 of the CS-building (exception: no exercises on May 1 but on Thursday May 2 at 14:15-16:00 in T7). Bug reports etc can be submitted to the MyCourses "General discussion" forum below.

    The course is lectured by Tomi Janhunen and Tommi Junttila. Welcome to the course!