|
|
|
|
|
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 2021.
| Number: | 326.065 |
| Title: | Rewriting in Computer Science and Logic |
| Lecturer: | Temur Kutsia |
| Time: | Friday, 12:00–13:30 |
| Room: | |
| Language: | English |
| First meeting: | March 12 |
| Registration: | Via the KUSSS system. Please register also for the exercises. |
| Grading: | Quizzes/tests during the semester, written exam at the end. |