ESSLLI 2002 Course on Description Logics    

This is the homepage of the ESSLLI 2002 course on Description Logics given by Carsten Lutz and Ulrike Sattler. ESSLLI 2002 has been held in Trento, Italy, 5-16 August 2002.

Course Information

Section: Logic and Computation
Time: First ESSLLI week (5-9 August) from 11:00 to 12:30
Type: Advanced Course
Prerequisites: We assume that participants are familiar with the fundamental notions of complexity theory. An acquaintance with basic modal logic will also be helpful.
Course Description:

Description Logics (DLs) are an important family of knowledge representation formalisms that is rather closely related to many Modal and Dynamic Logics. This course is targeted at participants with a background in Computer Science or Logic. It covers the fundamental principles of knowledge representation with DLs and discusses reasoning procedures for many state-of-the-art expressive Description Logics.

Starting from the basic propositionally closed Description Logic ALC, we gradually increase the expressive power of the presented logics. We discuss reasoning procedures (e.g., tableau algorithms and automata-based approaches) and analyze the trade-off between expressivity and complexity of the relevant inference problems. Throughout the course, we keep track of the correspondence between Description and Modal Logics. The various presented DLs are motivated using examples from knowledge representation. The course closes with system demonstrations illustrating modern applications of expressive DLs.

The course's goal is to provide participants with a general understanding of DLs, the current state-of-the-art of reasoning techniques for expressive DLs, and their applications.

Course Material

At ESSLLI, a small booklet will be available that contain a brief description of the course, some selected references, and two papers covering central topics of the course. The first two parts can be downloaded here.

The slides from the course can be downloade in PDF format:

If you have any questions, please contact us via mail.