For information on the authors, as far as they belong to the working
group, see the list of
current and former staff.
Andrea Sattler-Klein.
A systematic study of infinite canonical systems generated by
Knuth-Bendix completion and related problems.
Phdthesis, Fachbereich Informatik, Universität Kaiserslautern, 1996.
Birgit Reinert.
Introducing Reduction to Polycyclic Group Rings - A Comparison of Methods.
Reports on Computer Algebra No 9, Centre of Computer Algebra. Universität
Kaiserslautern, 1996.
Abstract,
Full Paper.
Birgit Reinert.
Gröbnerbasen.
manuscript for a lecture given in the winter term 1996/97, 1996.
Full Paper.
D. Plaisted and A. Sattler-Klein.
Proof Lengths for Equational Completion.
Information and Computation,
125 no. 2 pp. 154-170, 1996.
U. Kühler and C.-P. Wirth.
Conditional Equational Specifications of Data Types with Partial Operations
for Inductive Theorem Proving.
Report SR-96-11, SEKI University of Kaiserslautern, 1996.
Abstract,
Full Paper.
Martin Kronenburg, Reinhard Gotzhein, and Christian
Peper.
A Tailored Real Time Temporal Logic for Specifying Requirements of Building
Automation System.
SFB 501 Report No. 16/96, SFB 501 University of Kaiserslautern, 1996.
Full Paper.
Bernhard Gramlich and Claus-Peter Wirth.
Confluence of Terminating Conditional Term Rewriting Systems Revisited.
In
7th RTA, volume 1103 of
LNCS, pages 245-259.
Springer-Verlag, 1996.
Reinhard Gotzhein, Martin Kronenburg, and Christian
Peper.
Specifying and Reasoning about Generic Real-Time Requirements - A Case
Study.
SFB 501 Report No. 15/96, SFB 501 University of Kaiserslautern, 1996.
Full Paper.
M. Fuchs and A. Abecker.
Optimized Nearest-Neighbor Classifiers Using Generated Instances.
Report LSA-96-02E, LSA University of Kaiserslautern, 1996.
Full Paper.
J. Denzinger and M. Fuchs.
Experiments in Learning Prototypical Situations for Variants of the Pursuit
Game.
Report LSA-96-04E, LSA University of Kaiserslautern, 1996.
Full Paper.
Thomas Deiß.
Combining a state based formalism with temporal logic.
SFB 501 Report No. 05/96, SFB 501 University of Kaiserlautern, 1996.
Abstract,
Full Paper.
Jürgen Avenhaus and Klaus Madlener.
Theorembeweisen in hierarchischen bedingten Spezifikationen.
Informatik - Forschung und Entwicklung,
11 no. 2 pp. 53-60,
1996.
