Home | Study | International MSc | For Current Students

Courses in Winter Term 2006/07 - Logic Programming Engineering

Course title: Logic Programming Engineering

Lecturer: Dr. Nauber

Module: LCP

Status: foundation unit

SWS (lecture/tutorial/practical): 0/0/2

Credit points: 3

Examination method: written examination (CL students); project (Theory of Programming students)

Prerequisites:

basic knowledge about a programming language

Course description:

It's a basic Prolog Programming Course. After an introduction how to run SWI-Prolog under Windows NT at the computer laboratory we explain the syntax and data structures of a Prolog program. Many experiments with lists and recursive search give an understanding how does a Prolog program work. Some advanced programming techniques like nondeterministic programming, and the use of the cut-, input-, output- and built-in predicates, parsing with definite clause grammar, search techniques, and module system complete your knowledge about Prolog.

For higher-order programming we are using the lambda Prolog language. That allows polymorphic typing, lambda-terms as data structures, and quantification over predicates within queries.

The final part of this course shows how to build a major program. As an example we develop a game-playing program.

References:

Sterling, L.; Shapiro, E.: The Art of Prolog, MIT Press, 1994
O´Keefe, R.A.: The Craft of Prolog, MIT Press, 1994
Clocksin, W.F.; Mellish, C.S.: Programming in Prolog, Springer-Verlag, 1987
Bratko, I.: Prolog Programming for Artificial Intelligence, Addison-Wesley, 1986
Apt, K.R.: From Logic Programming to Prolog, Prentice Hall, 1997
Weisweber, W.: Prolog - Logische Programmierung in der Praxis, International Thomson Publishing, 1997
Endriss, U.: An Introduction to Prolog Programming, 2000
Miller, D.: lambda-Prolog: An Introduction to the Language and its Logic, 1998

Additional information:

the course web page
the course will be held in INF E040 on Wednesday DS 1 beginning on 18th October 2006