Term Rewriting Systems - NALG011
|
|
|
||
Last update: T_KA (25.05.2001)
|
|
||
Last update: RNDr. Pavel Zakouřil, Ph.D. (05.08.2002)
N. Dershowitz, J.-P. Jouannaud: Rewrite systems. Chapter 6, 243--320 in J.~van Leeuwen, ed., Handbook of Theoretical Computer Science, B: Formal Methods and Semantics. North Holland, Amsterdam 1990 |
|
||
Last update: T_KA (26.04.2004)
A. Winter semester:
1. Foundations of equational logiic.
2. Convergence in graphs.
3. Unification of terms.
4. Critical pairs for term rewrite systems.
5. Knuth-Bendux algorithm.
B. Summer semester:
1. Theory of well quasiorders.
2. Simplification quasiordering and its i,portance for termination.
3. Knuth-Bendix quasiorders.
4. Example: Term rewrite system for the equational theory of groups.
5. Dershowitz quasiorders.
6. Perfect bases of equational theories. |