Vorlesung

Einführung in die Künstliche Intelligenz (WS 00/01)

Dozent: Prof. Gerhard Lakemeyer, Ph.D.

Nähere Informationen zur Vorlesung (z.B. Termine, Ort, Inhalt) finden sich im Veranstaltungs-Informations-System VIS (WS 00/01), ebenso wie weitere Veranstaltungs-Ankündigungen des Lehr- und Forschungsgebiets Informatik V.

Diese Vorlesung wird in Englisch gehalten.

This lecture is held in English.



Lecture on

Introduction to Artificial Intelligence (Fall 2000)

Instructor: Prof. Gerhard Lakemeyer, Ph.D.
 Office Hour: Tuesdays 1-2 PM, or by appointment.

For information on the course (including the time and place of the lecture and the tutorials) see also the course information system VIS. For other information about teaching and research by Prof. Lakemeyer and his staff see the chair for knowledge-based systems.



News

Jan. 31, 2001:
concerning "regular" certificate exam:
Die "regulären" Prüfungen zum Erhalt eines Übungsscheins finden am 22. und 23. Februar 2001 statt. Anmeldungen dazu bitte bis 16.02.2001 per E-Mail an Gero Iwan unter Angabe von Name, Matrikelnummer und evtl. Terminproblemen. Es werden zwei Kandidaten zusammen geprüft, also kann man einen Partner benennen oder sich auch schon als Zweiergruppe anmelden.

Jan. 30, 2001:
In the tables of the solutions to Exercise 4.2 Fl(l) and Di(l) must be exchanged for each other.

Dec. 15, 2000:
There should be a small correction on transparency "Horn Clauses 9":
It should be "Solve[ p,...,pm ,q,...,q]" instead of "Solve[ p,...,pn ,q,...,q]".

Dec. 6, 2000:
Transparency "Resolution 31" is now in English completely.

Dec. 4, 2000:
There were typos in Exercise 3.3 on Assignment 3:
It should be "motherOf" instead of "MotherOf" and "fatherOf" instead of "FatherOf".

Nov. 29, 2000:
There was a fault on transparency "Resolution 1" which is now corrected:
... iff KB U {¬a} is unsatisfiable ...

Nov. 15, 2000:
The time for the tutorials is 12:00-13:30 (on Wednesday in the lecture room AH III) from now on.

Nov. 6, 2000:
There was a small correction on transparency "Search 14":
Search tree = the tree induced by expansion.
Each note contains a state; edges are actions.



Textbooks

Topics covered in the course

Tutorials

Teaching Assistants: Gero Iwan
Günter Gans


Date: March 13, 2001 - GI   |   Disclaimer   |   Home