Foundations of Artificial Intelligence (FAI) Group
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 Wednesdays 14:15--15:45, in HS002 (Building E1 3). There are four exceptions, i.e., dates where the lecture will be in Guenter-Hotz-Hoersaal (E2 2) instead: April 16, April 23, June 4, and June 18.
All lectures and tutorials will be held in English.
The lectures will be given by Prof. Joerg Hoffmann, and Prof. Wolfgang Wahlster for a block of 3 DFKI guest lectures. Prof. Slusallek and Dr. Kissmann will give further Guest Lectures.
The tutorials will be supervised by Dr. Peter Kissmann and Dr. Alvaro Torralba. The tutors are: Jeanette Aline Daum, Inken Hagestedt, Jesko Hecking-Harbusch, Sebastian Laska, Sreyasi Nag Chowdhury, and Frank Nedwed.
The lecture slides will be made available for download here, i.e., on this web page. By contrast, all exercises material and all interaction -- registration, announcements, technical discussions -- will be available and run through our Moodle pages. Apart from the lecture slide publication, this web page here will remain fixed throughout the course. (For the curious amongst you: the lecture slides will be made available here, as opposed to the Moodle pages, so that people from outside Saarland university can access them as well.)
To register for the course, open our Moodle pages, go to "Artificial Intelligence (Summer 2014)", and enter key "UDS-AI-14". You must have a valid email address ending with ".uni-saarland.de". (If you have no such email address, contact Peter Kissmann.)
For organizational details about the course, see Chapter 0 "About this Course" below.
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.
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.
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 table:
|Mon, 14.04.14||About This Course||Hoffmann||None|
|Wed, 16.04.14||Introduction to AI; General Problem Solving||Hoffmann||Russel/Norvig Chapter 1; None|
|Mon, 21.04.14||FREE (Ostern)|
|Wed, 23.04.14||Intelligent Agents||Hoffmann||Russel/Norvig Chapter 2|
|Mon, 28.04.14||Classical Search||Hoffmann||Russel/Norvig Chapter 3 and parts of Chapter 4|
|Wed, 30.04.14||Classical Search||Hoffmann||Russel/Norvig Chapter 3 and parts of Chapter 4|
|Mon, 05.05.14||Classical Search||Hoffmann||Russel/Norvig Chapter 3 and parts of Chapter 4|
|Wed, 07.05.14||Adversarial Search||Hoffmann||Russel/Norvig Chapter 5|
|Mon, 12.05.14||Guest Lecture on General Game Playing||Kissmann||None|
|Wed, 14.05.14||DFKI Guest Lecture||Slusallek||None|
|Mon, 19.05.14||Constraint Satisfaction Problems||Hoffmann||Russel/Norvig Chapter 6 (Loosely followed!)|
|Wed, 21.05.14||Constraint Satisfaction Problems||Hoffmann||Russel/Norvig Chapter 6 (Loosely followed!)|
|Mon, 26.05.14||Propositional Reasoning||Hoffmann||Russel/Norvig Chapter 7 (Loosely followed!)|
|Wed, 28.05.14||Propositional Reasoning||Hoffmann||Russel/Norvig Chapter 7 (Loosely followed!)|
|Mon, 02.06.14||Propositional Reasoning||Hoffmann||Russel/Norvig Chapter 7 (Loosely followed!)|
|Wed, 04.06.14||Predicate Logic Reasoning||Hoffmann||Russel/Norvig Chapters 8 and 9 (Loosely followed!)|
|Mon, 09.06.14||FREE (Pfingsten)|
|Wed, 11.06.14||Predicate Logic Reasoning||Hoffmann||Russel/Norvig Chapters 8 and 9 (Loosely followed!)|
|Mon, 16.06.14||Predicate Logic Reasoning||Hoffmann||Russel/Norvig Chapters 8 and 9 (Loosely followed!)|
|Wed, 18.06.14||DFKI Guest Lecture||Wahlster||None|
|Mon, 23.06.14||DFKI Guest Lecture||Wahlster||None|
|Wed, 25.06.14, 13:15--14:45||DFKI Guest Lecture||Wahlster||None|
|Mon, 30.06.14||Planning||Hoffmann||Does not follow Russel/Norvig (Chapter 10 can serve as general background)|
|Wed, 02.07.14||Planning||Hoffmann||Does not follow Russel/Norvig (Chapter 10 can serve as general background)|
|Mon, 07.07.14||Planning||Hoffmann||Does not follow Russel/Norvig (Chapter 10 can serve as general background)|
|Wed, 09.07.14||Planning||Hoffmann||Does not follow Russel/Norvig (Chapter 10 can serve as general background)|
|Mon, 14.07.14||Probabilistic Reasoning||Hoffmann||Russel/Norvig Chapter 13 and parts of Chapter 14|
|Wed, 16.07.14||Probabilistic Reasoning||Hoffmann||Russel/Norvig Chapter 13 and parts of Chapter 14|
|Mon, 21.07.14||Probabilistic Reasoning||Hoffmann||Russel/Norvig Chapter 13 and parts of Chapter 14|
|Wed, 23.07.14||Exam Preparation||Hoffmann||None|
|Mon, 28.07.14, 14:00--16:30||Written Exam|