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.
The lecture takes place twice a week in room GRU 350:
Tuesday 16:40-18:10 (DS6) and Thursday 16:40-18:10 (DS6).
NEW: The evaluation is available for
Since a script of the lecture is not available, it is recommended that
students attending the lecture copy what is written on the blackboard.
The following slides can be downloaded in postscript format:
The exercise group
takes place on Wednesday 11:10-12:40 (DS3) in room GRU 350 and is
held by Barbara Morawska.
Every week, an exercise sheet will be made available for download from this
- exercise sheet (for 15.10.2003), slides
- exercise sheet (for 22.10.2003), pdf file
- exercise sheet (for 29.10.2003),pdf file
- exercise sheet (for 5.11.2003), pdf file
- exercise sheet (for 12.11.2003), pdf file
- exercise sheet (for 20.11.2003), pdf file
- exercise sheet (for 26.11.2003), pdf file
- exercise sheet (for 3.12.2003), pdf file
- exercise sheet (for 10.12.2003), pdf file
- exercise sheet (for 17.12.2003), pdf file
- exercise sheet (for 7.1.2004), pdf file
- exercise sheet (for 14.1.2004), pdf file
- exercise sheet (for 21.1.2004), pdf file
- exercise sheet (for 28.1.2004), pdf file
- exercise sheet (for 4.2.2004), pdf file
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
Computer Science students are not obliged to present exercises, but are invited
to do so.
- present at least three exercises in front of the exercise group;
- pass an oral examination at the end of the term.
The following literature can be downloaded from the web or found at the WebOPAC of SLUB.
- F. Baader: Logic-Based Knowledge Representation. In M.J. Wooldridge
and M. Veloso, editors, Artificial Intelligence Today, Recent Trends
and Developments, number 1600 in Lecture Notes in Computer Science,
pages 13-41. Springer Verlag, 1999. Available electronically at
- F. Baader and U. Sattler. An Overview of Tableau Algorithms for
Description Logics. Studia Logica, 69:5-40, 2001. Available
- Halpern, J. Y. and Moses, Y.: A guide to completeness and complexity
for modal logic of knowledge and belief. Artificial Intelligence,
volume 54, pages 319-379, 1992.
- G. Brewka, J. Dix, and Kurt Konolige: Nonmonotonic Reasoning: An
Overview. CSLI Lecture Notes, volume 73, CSLI Publications", Stanford,