184.700 Declarative Problem Solving

2022W, VO, 2.0h, 3.0EC, to be held in blocked form


  • Semester hours: 2.0
  • Credits: 3.0
  • Type: VO Lecture
  • Format: Presence

Learning outcomes

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.

Subject of course

This course provides applications and examples well-suited for logic-oriented programming languages. The course is divided into three parts. The first part will introduce you to SAT and QSAT, while the following two parts will deal with answer-set programming.



  • The lecture is planned to be in presence mode but can, depending on the COVID situation, change into a hybrid presence-/online mode or a pure online mode.


  • Uwe Egly: SAT and QSA
  • Hans Tompits: ASP Part I
  • Tobias Geibinger: ASP Part II

Teaching methods

Frontal lecture.

Mode of examination


Additional information

ECTS breakdown: 3 ECTS = 75 hours

  • Lectures, course introduction 24h
  • Preparation for the final exam 50h
  • Final exam 1h

The course material is in English; introductory courses will be held in English on demand.



Course dates

Tue17:00 - 20:0011.10.2022 - 20.12.2022FH Hörsaal 2 Lecture
Declarative Problem Solving - Single appointments
Tue11.10.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue18.10.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue25.10.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue08.11.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue22.11.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue29.11.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue06.12.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue13.12.202217:00 - 20:00FH Hörsaal 2 Lecture
Tue20.12.202217:00 - 20:00FH Hörsaal 2 Lecture
Course is held blocked

Examination modalities

Oral exam.

Course registration

Begin End Deregistration end
25.09.2022 10:00 17.10.2022 23:55 17.10.2022 23:55


Study CodeSemesterPrecon.Info
No records found.


No lecture notes are available.

Previous knowledge

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

Accompanying courses


if required in English