Skript (Fassung vom 4.4.2011) - Lehr- und Forschungsgebiet ...

[KN85] M. S. KrishnamoorthyandP. Narendran. Onrecursive pathordering. Theoretical
Computer Science, 40:323-328, 1985.
[Kru60] J. B. Kruskal. Well-quasi-orderings, the tree theorem, and Vazsonyi’s conjecture.
Trans. Amer. Math. Society, 95:21-225, 1960.
[Lan79] D. S. Lankford. On proving term rewriting systems are noetherian. Technical
Report Memo MTP-3, Mathematic Department, Louisiana Technical University,
Ruston, LA, 1979.
[MN70] Z. Manna and S. Ness. On the termination of Markov algorithms. In Proceedings
of the 3rd Hawaii International Conference on System Science,pp. 789-792,1970.
[MM82] A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions
on Programming Languages and Systems, 4(2):258-282, 1982.
[MG95] A. Middeldorp and B. Gramlich. Simple termination is difficult. Applicable Algebra
in Engineering, Communication and Computing, 6:115-128, 1995.
[NO79] G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures.
ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
[NO80] G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure.
Journal of the ACM, 27(2):356-364, 1980.
[New42] M. H. A. Newman. On theories with a combinatorial definition of equivalence.
Annals of Mathematics, 43(2):223-242, 1942.
[Ohl02] E. Ohlebusch, Advanced Topics in Term Rewriting. Springer, 2002.
[Opp80] D. C. Oppen. Reasoning about recursively defined data structures. Journal of
the ACM, 27(3):403-411, 1980.
[Rob65] J. A. Robinson. A machine oriented logic based on the resolution principle. Journal
of the ACM, 12:23-41, 1965.
[RS02]
H. Rueß and N. Shankar. Deconstructing Shostak. Proceedings of the IEEE Symposium
on Logic in Computer Science, LICS 2001, Boston, Massachusetts, 2001.
[Sho78] R. E. Shostak. An algorithm for reasoning about equality. Communications of
the ACM, 21(7):583-585, 1978.
[Sho84] R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-
12, 1984.
[Ste95]
J. Steinbach. Simplification orderings: History of results. Fundamenta Informaticae,
24:47-87, 1995.
[Ter03] Terese. Term Rewriting Systems. Cambridge University Press, 2003.
[Wal95] C. Walther. Reduktionssysteme. Skript zur Vorlesung, TU Darmstadt, 1995.