Jürgen Avenhaus's Home Page
Address:
Jürgen Avenhaus
Head of the AG Effiziente Algorithmen
Universität Kaiserslautern
Fachbereich Informatik
Postfach 3049
67653 Kaiserslautern, Germany
Tel: ++49 631 205 2633
Fax: ++49 631 205 3558
Email: avenhaus@informatik.uni-kl.de
Gebäude 34, 412
Program Committee Member of
Publications:
- Avenhaus, J. ; Madlener, K.: Term rewriting and equational reasoning,
in R.B. Banerji (ed): Formal Techniques in Artificial Intelligence, Elsevier, 1990, pp. 1-43.
- Avenhaus, J.: Proving equational and inductive theorems by completion and embedding techniques, Proc. RTA-91, LNCS 488, 1991, pp. 361-373.
- Avenhaus, J. ; Becker, K.: Conditional rewriting modulo a built-in algebra, SEKI-Report SR-92-11, University of Kaiserslautern, 1992.
- Avenhaus, J. ; Denzinger, J. ; Hoffmann, T.: Efficient AC1-matching
using constraints, SEKI-Report SR-92-03, University of Kaiserslautern, 1992.
- Avenhaus, J. ; Denzinger, J.: Distributing equational theorem proving,
Proc. RTA'93, Montreal, LNCS 690, 1993, pp. 62-76.
Also as SEKI-Report SR-93-06, University of Kaiserslautern, 1993.
- Avenhaus, J. ; Loria-Saenz, C.: Canonical Conditional Rewrite Systems Containing
Extra Variables, SEKI-Report SR-93-03, University of Kaiserslautern, 1993.
- Avenhaus, J. ; Becker, K.: Operational specifications with built-ins,
Proc. 11th STACS, LNCS 775, 1994, pp. 263-274.
- Avenhaus, J. ; Loria-Saenz, C.: Higher order conditional rewriting and narrowing, Proc. 1st CCL, LNCS 845, 1994, pp. 269-284.
- Avenhaus, J. ; Loria-Saenz, C.: On conditional rewrite systems with
extra variables and deterministic logic programs, Proc. LPAR-94, LNCS 822,
1994, pp. 215-229.
- Avenhaus, J. ; Loria-Saenz, C.: A Reduction Ordering for Higher-Order Terms,
SEKI-Report SR-95-03, University of Kaiserslautern, 1995.
- Avenhaus, J.: Reduktionssysteme (in german), Springer Verlag, 1995
- Avenhaus, J. ; Plaisted, D.A.: General Algorithms for Permutations in Equational Inference, SEKI-Report SR-95-07, University of Kaiserslautern, 1995.