Content

• Study of the syntax of Prolog and the procedural meaning of Prolog programs. Study of data structures (lists, trees, ...), of data representation (as terms or as predicates), and their use in the context of some problem solving examples.
• Study of builtins (a.o. for operators, arithmetic, input-output, findall,...), modules, cut, and negation.
• Study of more advanced programming techniques such as open-ended structures, failure-driven iteration, metainterpreters, definite clause grammars.
• Study of extensions of basic Prolog systems (possible candidates are constraint logic programming, programming with delays).
• Practical exercises with a Prolog system will be an indispensable part of the course.

Aims

Description of learning activities

This course uses a kind of guided independent learning.
Every week the students have to prepare a part of the course (typically some sections in the handbook).  In addition, they get a number of questions about the prepared material.  They can hand in their answers (e.g. by e-mail).
During the weekly sessions students get the opportunity to ask questions/further explanations about the studied material.  We typically make also some more, related exercises in an interactive setting. 
Sometimes the next topic is briefly introduced.

Course material

PROLOG Programming for Artificial Intelligence,
Ivan Bratko
Addison Wesley, third edition 2001.
ISBN 0201-40375-7

Content

The exercise sessions are  related to the material of the course.

Description of learning activities

11 exercise sessions: part of the exercise sessions are in a PC-labo, the rest are classical ones.