[TU Dresden]

Logic-based Knowledge Representation

Technische Universität Dresden
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie

Prof. Franz Baader

Course Description

Starting from a short description of early knowledge representation formalisms (such as Semantic Networks and Frames) and their shortcomings, the course will illustrate how results and methods from logic can support the design of knowledge representation systems that have high expressive power and sound and complete reasoning algorithms. In particular, we will consider Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for respectively representing terminological knowledge, subjective and time dependent knowledge, and uncertain and incomplete knowledge.

Organization

The lecture takes place twice a week in room GRU 350: Tuesday 16:40-18:10 (DS6) and Thursday 16:40-18:10 (DS6).

During Summer School (4.07-15.07) the lecture will take place in Room 370.

Lecture Material

Part of the script for the lecture is available here (New full version!). It is recommended that students attending the lecture copy what is written on the blackboard. Some slides will be made avaliable for download in postscript format.

Exercises

The exercise group takes place once a week in room GRU 350 and is held by Barbara Morawska.

Every week, an exercise sheet will be made available for download from this webpage.
  1. exercises (for 13.4)
  2. exercises (for 20.4)
  3. exercises (for 27.4)
  4. exercises (for 4.5)
  5. exercises (for 11.5)
  6. exercises (for 25.5)
  7. exercises (for 1.6)
  8. exercises (for 8.6)
  9. exercises (for 15.6)
  10. exercises (for 22.6)
  11. exercises (for 29.6)
  12. exercises This week we meet on Friday, (8.07.) 14:50-16:20, in Room 450.
  13. exercises (for 13.6) Room 470

Credits / Examinations

Computational logic students can earn 9 credits by attending this lecture. The lecture can be used for the modules KRAI and TCSL. In order to get the credits, CL students have to do meet both of the following two obligations:
  1. present at least four exercises in front of the exercise group;

  2. pass an oral examination at the end of the term.
Computer Science students are not obliged to present exercises, but are invited to do so.

Literature

The following literature can be downloaded from the web or found at the WebOPAC of SLUB.

Barbara Morawska