|
|
|
|
|
This lecture is intended to give an introduction to term rewriting systems and their application in computer science and logic. In particular we will discuss general reduction relations, properties of reduction systems such as confluence and termination, and completion procedures.
Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They have applications in many areas, from functional programming to automatic theorem proving and computer algebra. The theory of rewriting is fundamental to concepts in constructive algebra, such as Gröbner bases, and also to concepts in logic, such as decision of equational theories (e.g. the theory of groups).
Summer Semester 2025.
| Number: | 326.064, 326.065 |
| Title: | Rewriting in Computer Science and Logic |
| Lecturer: | Temur Kutsia |
| Time: | Friday, 12:00–13:30 |
| Room: | K 153C |
| Language: | English |
| Mode: | In presence |
| First meeting: | March 7 |
| Registration: | Via the KUSSS system. |
| Grading: | Written exam on Friday, June 27, 13:45–15:15, in Linz (room K 269D), Vienna, and Bregenz (distance learning centers). |
This course is listed in the KUSSS under two names: