Content
The course will cover advanced and current developments in term rewriting:
-
confluence criteria
-
context-sensitive rewriting
-
proof terms
-
tree automata techniques
Basic knowledge of term rewriting (as covered in the bachelor course
Term Rewriting) is assumed.
Schedule
| week |
date |
topics |
slides |
solutions |
material |
|---|
| 1 |
07.10 |
review bachelor TRS course |
pdf (1x1, 4x1) |
pdf |
link |
| 2 |
14.10 |
tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 3 |
21.10 |
tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 4 |
28.10 |
tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 5 |
04.11 |
first-order theory of rewriting |
pdf (1x1, 4x1) |
pdf |
link |
| 6 |
11.11 |
tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 7 |
18.11 |
tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 8 |
25.11 |
confluence criteria |
pdf (1x1, 4x1) |
pdf |
link |
| 9 |
02.12 |
confluence criteria |
pdf (1x1, 4x1) |
pdf |
link |
| 10 |
09.12 |
confluence criteria |
pdf (1x1, 4x1) |
pdf |
link |
| 11 |
13.01 |
confluence criteria, tree automata techniques |
pdf (1x1, 4x1) |
pdf |
link |
| 12 |
20.01 |
tree automata techniques |
pdf (1x1, 4x1) |
|
link |
| 13 |
27.01 |
test
solution |
|
|
|
Literature
The course material and slides will be made available online. The same
holds for solutions to selected exercises.