Foundations of Artificial Intelligence (FAI) Group
divider line


Core Lecture: Artificial Intelligence


Organization. Successful participation in the course yields 9 ECTS.

The course consists of oral lectures, 2*90 minutes per week, as well as exercises that will be supervised in tutorial groups (90 minutes/week).

The lectures will be held Mondays 10:15 -- 11:45, and Tuesdays 8:30 -- 10:00, in Guenter-Hotz-Hoersaal (E2 2).

All lectures and tutorials will be held in English.

The lectures will be given by Prof. Dr. Joerg Hoffmann. The tutorials will be supervised by Dr. Peter Kissmann. The tutors are: Ilya Grishchenko, Evica Ilieva, Alexander Kampmann, Vikram Mehta, Frank Nedwed, and Sarah Schaeffer (see the Chapter 0 Post-Handouts for their email addresses).

Exercises and discussion of technical questions will be organized via our Moodle pages.


Abstract. This course explores key concepts of Artificial Intelligence (AI), including heuristic search algorithms, adversarial search, constraint satisfaction problems, propositional and first-order reasoning, the automatic generation of heuristic functions in planning, and reasoning under uncertainty. We will highlight how these concepts are used in a variety of AI applications; in particular, guest lectures by researchers from DFKI are anticipated. Upon completion of the course, students should be able to write Bachelor and Master theses in AI. This core lecture is also the prerequisite for advanced courses such as Automatic Planning, Intelligent User Interfaces, and Semantic Web. Interested students will have the unique opportunity to participate in exciting AI research projects in the FAI group or at DFKI.


Exercises. The exercises will involve applying the introduced concepts and algorithms to examples, and leading simple proofs. Solutions can be submitted in groups of 3 authors, all of which must be registered into the same tutorial group.

Registration for the tutorials is CLOSED. If you want to switch your toturial group still, you need to find a switching partner. We recommend to do so using the Moodle "Technical Discussion" section as a billboard. Once you did find a switching partner, please contact the tutors of both groups involved.

Here is the final schedule of tutorials:

Each exercise sheet will be handed out on a Monday (week X), via download in our Moodle pages. Submission of solutions will be in paper form only, just before the start of the lecture, on Monday week X+1, in the lecture hall. (Attention: You must comply with the submission rules as stated on each sheet, else 3 points will be subtracted from your score.) The tutorials about each sheet will be in week X+2.

Here's a detailed list of the release and submission dates, for each sheet (note the gap in June, during the DFKI Guest Lectures):


Exam and final grade. There will be a written exam at the end of the course. 50 percent of the points from the exercises are needed for admission to the exam. The final grade will be determined based on the performance in the exam. A second, slightly harder, exam will be held end September/beginning October. The better grade of the two exams counts.

The first exam will take place on Monday, July 29, 9:45 -- 12:00. The exam will be written in Guenter-Hotz-Hoersaal (E2 2); depending on the number of students, we will also use HS 002 (E1 3). All students must be at Guenter-Hotz-Hoersaal at 9:45.

The second exam will take place on Wednesday, September 25, 14:00 -- 16:15. The exam will be written in Guenter-Hotz-Hoersaal (E2 2); depending on the number of students, we will also use HS 002 (E1 3). All students must be at Guenter-Hotz-Hoersaal at 13:45.


Course Material. There are two kinds of slides, pre-handouts and post-handouts. Pre-handouts do not contain the answers to questions asked during the lecture sessions, and do not contain the details for examples worked during the lecture sessions. The post-handouts do contain all this, and correct any bugs. The pre-handouts are made available one day before the lecture sessions on each chapter, the post-handouts are made available directly after the lecture sessions on a chapter are finished.

Most of the course follows the standard AI text book by Russel and Norvig (RN). HOWEVER, several chapters do NOT follow that book one-to-one, and some do not follow it at all. The ground truth throughout the course are the results as stated in the post-handouts. A few details about the relevant chapters of RN are given in the table at the end of this page, as well as at the end of each topic in the post-handouts.


Course Overview. The provisional outline of the course is specified in the following calendar and table:

Date Content Lecturer Material
Mon, 15.04.13 About This Course Hoffmann None
Tue, 16.04.13 Introduction to AI; General Problem Solving Hoffmann Russel/Norvig Chapter 1; None
Mon, 22.04.13 Intelligent Agents Hoffmann Russel/Norvig Chapter 2
Tue, 23.04.13 Search Hoffmann Russel/Norvig Chapter 3 and parts of Chapter 4
Mon, 29.04.13 Search Hoffmann Russel/Norvig Chapter 3 and parts of Chapter 4
Tue, 30.04.13 Search Hoffmann Russel/Norvig Chapter 3 and parts of Chapter 4
Mon, 06.05.13 Adversarial Search Hoffmann Russel/Norvig Chapter 5
Tue, 07.05.13 Adversarial Search; Guest Lecture on General Game Playing Hoffmann; Kissmann Russel/Norvig Chapter 5; None
Mon, 13.05.13 Constraint Satisfaction Problems Hoffmann Russel/Norvig Chapter 6 (Loosely followed!)
Tue, 14.05.13 Constraint Satisfaction Problems Hoffmann Russel/Norvig Chapter 6 (Loosely followed!)
Mon, 20.05.13 FREE (Pfingsten)
Tue, 21.05.13 Propositional Reasoning Hoffmann Russel/Norvig Chapter 7 (Loosely followed!)
Mon, 27.05.13 Propositional Reasoning Hoffmann Russel/Norvig Chapter 7 (Loosely followed!)
Tue, 28.05.13 Propositional Reasoning Hoffmann Russel/Norvig Chapter 7 (Loosely followed!)
Fri, 31.05.13, 12:15--13:45 (replacement slot) Predicate Logic Reasoning Hoffmann Russel/Norvig Chapters 8 and 9 (Loosely followed!)
Mon, 03.06.13 Predicate Logic Reasoning Kissmann Russel/Norvig Chapters 8 and 9 (Loosely followed!)
Tue, 04.06.13 Predicate Logic Reasoning Kissmann Russel/Norvig Chapters 8 and 9 (Loosely followed!)
Mon, 10.06.13 DFKI Guest Lecture Prof. Wolfgang Wahlster None
Tue, 11.06.13 DFKI Guest Lecture Prof. Wolfgang Wahlster None
Mon, 17.06.13 FREE
Tue, 18.06.13 DFKI Guest Lecture Prof. Wolfgang Wahlster None
Fri, 21.06.13, 12:15--13:45 (replacement slot) Planning Hoffmann Does not follow Russel/Norvig (Chapter 10 can serve as general background)
Mon, 24.06.13 Planning Hoffmann Does not follow Russel/Norvig (Chapter 10 can serve as general background)
Tue, 25.06.13 Planning Hoffmann Does not follow Russel/Norvig (Chapter 10 can serve as general background)
Mon, 01.07.13 Planning Hoffmann Does not follow Russel/Norvig (Chapter 10 can serve as general background)
Tue, 02.07.13 Probabilistic Reasoning Hoffmann Russel/Norvig Chapter 13 and parts of Chapter 14
Mon, 08.07.13 Probabilistic Reasoning Hoffmann Russel/Norvig Chapter 13 and parts of Chapter 14
Tue, 09.07.13 Probabilistic Reasoning Hoffmann Russel/Norvig Chapter 13 and parts of Chapter 14
Mon, 15.07.13 Exam Preparation Kissmann None
Tue, 16.07.13 DFKI Guest Lecture Prof. Philipp Slusallek None
Mon, 22.07.13 FREE
Tue, 23.07.13 FREE
Mon, 29.07.13, 9:45--12:00 Written Exam