After successful completion of the course, students are able to name and explain different tools, languages, and logicoriented methods for declarative problem solving, as well as to correctly argue theoretical relations. In particular, after successfully complete of the course, students are able to 

• analyse employed techniques and methods,
• select relevant techniques and methods for a given problem, and
• critically assess relevant solutions and formalisms.

This course provides applications and examples well-suited for logic-oriented programming languages. The course is divided into three parts, each starting with an introductory lecture and finishing with the solution of a larger exercise, split into sub-tasks. The first part will introduce you to SAT and QSAT, while the following two exercises will deal with answer-set programming.

Organisation

Attention: This semester, the lecture will be held in distance-learning modus. Exercise sheets will be available through TUWEL and solutions are to be uploaded in TUWEL too.  Turn-in discussions will be made using a video-conferencing tool. Also, tutor hours for questions will be held with video-conferencing too.

Registration until 2020/10/19 as follows:

1. Subscribe to course in TISS and activate forum participation.
2. Register at "Declarative Problem Solving Course Registration".

IMPORTANT:

• Registration (as above) is required.
• No belated possibility to (un-)register after 2020/10/19!
• The above group is for registration purposes only. The course exercises are single student exercises; "teamwork" solutions, at least obviously identical turned-in files, will not be accepted.

Further organizational details (dates, etc.) will be posted in TISS.

Tutors

Availability of tutors for questioning will be made available as part of the corresponding TUWEL course. The tutor hours will be held by means of a video conference. Details will be made available in TUWEL.  

3 projects

• Project 1: SAT (turn-in deadline: November 9, 2020, 23:55; mandatory project presentation in week 47 of 2020).
• Project 2: Answer Set Programming with DLV (first turn-in deadline: November 30, 2020, 23:55; second turn-in deadline: December 14, 2020, 23:55).
• Project 3: Answer Set Programming with clasp (first turn-in deadline: January 11, 2021, 23:55; second turn-in deadline: January 25, 2021, 23:55).

There will be two turn-in possibilities for project 2 and 3. The procedure is as follows:

• your solutions will be tested with automatic test cases;
• tentative points will be made available in TUWEL;
• there is a possibility to turn-in (repeatedly) on the 2nd turn-in deadline 2 weeks later (p_i = achieved points for i-th turn-in (i=1,2)), where the total points for your project are calculated as follows:
• if you deliver your project at both turn-in 1 and 2: maximum of the points of the weighted mean: max { p_1, 0.8*p_2, (p_1 + 0.8*p_2)/1.8 },
• if you only deliver your project at turn-in 1: p_1,
• if you only deliver your project at turn-in 2: 0.8 * p_2,
• 0, otherwise.

Solving of exercises.

ECTS breakdown: 3 ECTS = 75 hours

• Course introduction 0.5h
• Solving 1 SAT project and 2 ASP projects 73.5h
• Presentation of the projects 1h

The grading is on the basis of the submitted solutions.

Grading key:

< 51 points: N5
 >= 51 points: G4
 >= 63 points: B3
 >= 75 points: U2
 >= 88 points: S1

NOTE: Course materials are available from the TISS page of the according VO and from TUWEL.

Basic knowledge of Mathematical Logic (Unification, Horn-Clause Resolution).