| Publications 1993 |
For information on the authors, as far as they belong to the working group, see the list of current and former staff.
C.-P. Wirth, B. Gramlich, U. Kühler, and H. Prote.
Constructor-based inductive validity in positive/negative conditional
equational specifications.
Report SR-93 -05, SEKI University of Kaiserslautern, 1993.
Joachim Steinbach.
Simplification orderings: Putting them to the test.
Journal of Automated Reasoning, no. 10 pp. 389-397, 1993.
Joachim Steinbach.
On the complexity of simplification orderings.
Report SR-93-18, SEKI University of Kaiserslautern, 1993.
Full Paper.
Andrea Sattler-Klein.
About changing the ordering during Knuth-Bendix completion.
Report SR-93-19, SEKI University of Kaiserslautern, 1993.
Full Paper.
A. Middeldorp and B. Gramlich.
Simple termination is difficult.
In 5th RTA, volume 690 of LNCS, pages 228-242, 1993.
Klaus Madlener and Birgit Reinert.
On Gröbner Bases in monoid and group rings.
Report SR-93-08, SEKI University of Kaiserslautern, 1993.
Abstract, Full Paper.
Klaus Madlener and Birgit Reinert.
Computing Gröbner Bases in monoid and group rings.
In ISSAC 93, pages 254-263, 1993.
Abstract.
K. Madlener, P. Narendran, F. Otto, and L. Zhang.
On weakly confluent monadic string-rewriting systems.
Theoretical Computer Science, no. 113 pp. 119-165, 1993.
Andrea Sattler-Klein Klaus Madlener and Friedrich Otto.
On the problem of generating small convergent systems.
Journal of Symbolic Computation, 2 no. 16 pp. 167-187, 1993.
Bernhard Gramlich.
Sufficient conditions for modular termination of conditional term rewriting
systems.
In 3rd CTRS (1992), volume 656 of LNCS, pages 128-142,
1993.
Bernhard Gramlich.
Relating innermost, weak, uniform and modular termination of term rewriting
systems.
Report SR-93-17, SEKI University of Kaiserslautern, 1993.
Full Paper.
Bernhard Gramlich.
Relating innermost, weak, uniform and modular termination of term rewriting
systems.
Report SR-93-09, SEKI University of Kaiserslautern, 1993.
Full Paper.
D. Cohen, K. Madlener, and F. Otto.
Separating the intrinsic complexity and the derivational complexity of the
word problem for finitely presented groups.
Math. Log., no. 39 pp. 143-157, 1993.
| RG Foundations of Informatics | Department of Informatics | Technical University of Kaiserslautern |