Term rewriting systems can be used to compute in structures that are
defined by equations. They are thus an important tool in automated
deduction, algebraic specification, and functional programming. The
course introduces important properties such as termination and
confluence in the framework of abstract reduction systems, gives a
brief introduction into universal algebra, and then concentrates on
confluence, termination, and completion of term rewriting systems.
Prerequisites: Basic notions from a course on discrete algebraic
structures would be helpful.
The lecture takes place twice a week in room E05:
Tuesday 16:40-18:10 and Thursday 16:40-18:10.
The exercise group will be held by Barbara Morawska. It meets on Wednesdays 14:50-16:20 in E05.
The exercises can be downloaded in Postscript format (the
exercises for next week will be available on Friday at noon this week,
- exercises (for Tuesday, 21.10.2008)
- exercises (for Tuesday, 28.10.2008)
- exercises (for Wednesday, 29.10.2008)
- exercises (for Wednesday, 5.11.2008)
- exercises (for Wednesday, 12.11.2008)
- exercises (for Wednesday, 26.11.2008)
- exercises (for Wednesday, 3.12.2008)
- exercises (for Thursday, 11.12.2008)
- exercises (for Wednesday, 17.12.2008)
- exercises (for Thursday, 18.12.2008) ← additional tutorial!
- exercises(for Wednesday, 21.01.2009)
- exercises Tuesday, 03.02.2009 ← additional tutorial!
- exercises(for Wednesday, 04.02.2009)
Credits / Examinations
Computational logic students can earn 10 credits by attending this lecture.
In order to get the credits, CL students have to meet both of the following two
Computer Science students are not obliged to present exercises, but are invited
to do so.
- present at least four exercises in front of the exercise group;
- pass an oral examination at the end of the term performed by Prof. Baader.
The lecture is based on
- F. Baader, T. Nipkow. Term Rewriting and All That. ISBN 0-521-77920-0,
Cambridge University Press, 1998