Institutslogo Abteilung Grundlagen der Künstlichen Intelligenz, Institut für Informatik, Universität Freiburg

Principles of Knowledge Representation

Sommersemester 2003

Lecturers: Prof. Dr. Bernhard Nebel and Dr. Jussi Rintanen, Exercises: Malte Helmert

[Overview] [Lecture] [Assignments] [Terminology]

Time

Lectures: Wednesday 13:25-15:00 and Friday 14:15-15:00
Exercise sessions: Friday 13:25-14:10
Exam: Monday, August 4th, 9:15-10:45
Repeat Exam: The tentative date for oral repeat exams is Wednesday, October 1st. You should have received an e-mail with details if you are a candidate for the repeat exam. If you have not, please contact us!

Location

Lectures and Exercise sessions: Room SR 02-017, building 052
Exam: Room 00-010/014, building 101

Language

Lectures, slides, additional learning materials, assignments and the exam will be in English.
Participants may ask questions and write down their exercise and exam results in English or German.

The course offers a detailed introduction to the main logical systems that form the basis of advanced systems for knowledge representation and reasoning, including

semantic networks and inheritance,
description logics,
systems for nonmonotonic reasoning, including default logic and argumentation systems,
belief revision, and
systems for temporal and spatial reasoning, including Allen's interval calculus and the region connection calculus RCC-8.

Many of these systems are based on classical propositional logic and its extensions, like modal logics, which are also introduced in the course.

Prerequisites

Participants of the course are expected to have basic knowledge in AI, propositional logic and computational complexity theory.

Exam and Assignments

In order to obtain a "Schein" or credit points (as applicable), participants are required to pass an exam at the end of the semester.
The course is worth six credit points.

In addition to the exam, there will be a mixture of weekly theoretical assignment (exercises) and occasional practical assignments (projects). These are not cumpulsory, but extra exam marks can be obtained by working on them. Participants are allowed and encouraged to work on assignments and submit their results in groups of two. However, larger groups and copied results will not be accepted.

Up to 100 exam marks are awarded for the exam proper.
Up to 10 extra exam marks are awarded for good exercise results. To get any extra marks, an exercise score of at least 50% is required. Each five percent above this threshold translate to one exam mark.
Up to 5 extra exam marks are awarded for projects. Each project is worth a certain amount of marks (usually 1-3). Participants may work on as many projects as they choose, but the total amount of extra marks from projects is capped at 5 per person.

Time Table

Day	Topics	Slides	Revised
20-Okt-05	1. Introduction: 1.1 Organization	full size (PS) 4-on-1 (PS)
--0	1. Introduction: 1.2 Motivation	full size (PS) 4-on-1 (PS)
--0	2. Reminder: 2.1 Propositional Logic	full size (PS) 4-on-1 (PS)	05-May-03
--0	2. Reminder: 2.2 First Order Logic	full size (PS) 4-on-1 (PS)
--0	3. Modal Logics: 3.1 Boxes and Diamonds	full size (PS) 4-on-1 (PS)	18-May-03
--0	3. Modal Logics: 3.2 Semantics and Proof Systems	full size (PS) 4-on-1 (PS)	1-July-03
--0	5. Nonmonotonic Reasoning: 5.1 Introduction	full size (PS) 4-on-1 (PS)
--0	5. Nonmonotonic Reasoning: 5.2 Default Logic	full size (PS) 4-on-1 (PS)	18-June-03
--0	5. Nonmonotonic Reasoning: 5.3 Nonmonotonic Logic Programs	full size (PS) 4-on-1 (PS)
--0	5. Nonmonotonic Reasoning: 5.4 Introduction to Cumulative Logics	full size (PS) 4-on-1 (PS)
--0	5. Nonmonotonic Reasoning: 5.5 Cumulative and Preferential Models	full size (PS) 4-on-1 (PS)	2-July-03
--0	4. Semantic Networks and Description Logics: 4.1 Introduction	full size (PS) 4-on-1 (PS)
--0	4. Semantic Networks and Description Logics: 4.2 Simple, Strict Inheritance Networks	full size (PS) 4-on-1 (PS)
--0	4. Semantic Networks and Description Logics: 4.3 Description Logics	full size (PS) 4-on-1 (PS)
--0	4. Semantic Networks and Description Logics: 4.4 Reasoning Services and Reductions	full size (PS) 4-on-1 (PS)
--0	4. Semantic Networks and Description Logics: 4.5 Algorithms	full size (PS) 4-on-1 (PS)
--0	4. Semantic Networks and Description Logics: 4.6 Complexity	full size (PS) 4-on-1 (PS)
--0	6. Qualitative Representation and Reasoning: 6.1 Introduction	full size (PS) 4-on-1 (PS)	9-July-2003
--0	6. Qualitative Representation and Reasoning: 6.2 Allen's Calculus	full size (PS) 4-on-1 (PS)
--0	6. Qualitative Representation and Reasoning: 6.3 Reasoning in Allen's Interval Calculus	full size (PS) 4-on-1 (PS)
--0	6. Qualitative Representation and Reasoning: 6.4 A Maximal Tractable Sub-algebra	full size (PS) 4-on-1 (PS)
--0	6. Qualitative Representation and Reasoning: 6.5 RCC8 and Topology	full size (PS) 4-on-1 (PS)	23-July-03
--0	6. Qualitative Representation and Reasoning: 6.6 Reasoning with RCC8	full size (PS) 4-on-1 (PS)
--0	6. Qualitative Representation and Reasoning: 6.7 Spatial-Temporal Representation and Reasoning	full size (PS) 4-on-1 (PS)