For information on the authors, as far as they belong to the working
group, see the list of
current and former staff.
Claus-Peter Wirth.
Syntactic Confluence Criteria for Positive/Negative-Conditional Term
Rewriting Systems.
Report SR-95-09, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
C.-P. Wirth and U. Kühler.
Inductive Theorem Proving in Theories Specified by
Positive/Negative-Conditional Equations.
Report SR-95-15, SEKI Report SR-95-15 University of Kaiserslautern, 1995.
Abstract,
Full Paper.
Birgit Reinert.
On Gröbner Bases in Monoid and Group Rings.
Phdthesis, Fachbereich Informatik, Universität Kaiserslautern, 1995.
Abstract,
Full Paper.
D. Plaisted and A. Sattler-Klein.
Proof Lengths for Equational Completion.
Report SR-95-06, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
Klaus Madlener and Birgit Reinert.
On Gröbner Bases for Two-Sided Ideals in Nilpotent Group Rings.
Report SR-95-01, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
M. Fuchs.
Learning proof heuristics by adapting parameters.
In
12th Intern. Conf. on Machine Learning, pages 235-243. Morgan
Kaufmann Publishers, 1995.
Also as SEKI-Report 95-02.
M. Fuchs.
Learning proof heuristics by adapting parameters.
Report SR-95-02, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
M. Fuchs.
Exploiting past proof experience.
Report LSA-95-08E, LSA University of Kaiserslautern, 1995.
Full Paper.
M. Fuchs.
Experiments in the Heuristic Use of Past Proof Experience.
Report SR-95-10, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
T.A. Foley, S. Dayanand, and D. Zeckzer.
Localized radial basis methods using rational triangle patches.
Computing,
10 (sup) pp. 163-176, 1995.
Jürgen Avenhaus and Klaus Madlener.
Theorem Proving in Hierarchical Clausal Specifications.
Report SR-95-14, SEKI University of Kaiserslautern, 1995.
Abstract,
Full Paper.
