Course material Fundamentals of Artificial Intelligence


NEW: In the next file are a bunch of examples of theory questions that are possible of the FAI theory examination. I have restricted the example questions to the part on "Search".
FAI-example-questions

NEW: Here is the missing material on Waltz constraint processing and on Strips planning Walts_and_Strips (pdf)

Below are all the presentations for the lectures in the Fundamentals of AI course. Note that the handouts are on a separate sub page of my home page.

Introduction to AI and to this course

Introduction to State Space Representation

Basic Search: Blind search

Basic Search: Heuristic search

Optimal Search

Advanced issues in Search

Games

MS Word document on Constraint Propagation

Constraint processing: backtrack techniques

Constraint processing: consistency and hybrid techniques

Version Spaces Machine Learning

Planning STRIPS

Note that there are also some handwritten slides on the topics of:

Applications of constraint processing in interpretation of line drawings (see also the book of P.H.Winston, "Artificial Intelligence, third edition"),

Applications of constraint processing in Natural Language (see also Winston).

The material for this are the corresponding chapters in the book of Winston: "Symbolic Constraint Processing" and "Frames and Common Sense".

In general, it is a good idea to buy a copy of the course notes. It can be obtained from the student organisation VTK.

The above material is the content for the FAI course FOR THE STUDENTS OF THE CS-option AND THE SLT-option OF MAI, as well as for students from other programs at K.U.Leuven who take FAI as a 3 point-course.

Students in the MAI program following the option ECS should in addition follow the part on automated reasoning. The slides (powerpoint presentations) for the automated reasoning part are listed below.

Automated Reasoning: Introduction

Automated Reasoning: Ground Horn Logic

Automated Reasoning: Horn Logic

Automated Reasoning: Clausal Logic

Automated Reasoning: Logic Programming

Planning Temporal

Below is the extra material for the BDA-option. It will be uploaded as soon as it becomes available. The topics are Local Search and Optimisation, Introduction to Logic and SAT-solving.

Local Search and Optimisation

SAT-solving-Logic

SAT-solving

Further links are on the exercises and the guidelines for the exam.

EXERCISE ASSIGNMENTS

GUIDELINES FOR THE EXAMINATION