# Comtes — An experimental environment for the completion of term rewriting systems

System Descriptions

First Online:

## Preview

Unable to display preview. Download preview PDF.

## 5. References

- [AGGMS87]Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach:
*TRSPEC — a term rewriting based system for algebraic specifications,*Proc. 1st int. workshop on conditional term rewriting systems, LNCS 308, Orsay, France, July 1987, pp. 245–248Google Scholar - [AGM88]Jürgen Avenhaus, Bernhard Gramlich, Klaus Madlener:
*Experimental tools for rewriting techniques and applications at Kaiserslautern — An overview,*Draft, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, November 1988Google Scholar - [Av83]Jürgen Avenhaus:
*Reduction systems,*Manuscript of a lecture, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, Summer 1983 (in German)Google Scholar - [BD88]Leo Bachmair, Nachum Dershowitz:
*Critical pair criteria for completion,*J. symbolic computation 6, 1988, pp. 1–18Google Scholar - [BL87]Ahlem Ben Cherifa, Pierre Lescanne:
*Termination of rewriting systems by polynomial interpretations and its implementation,*Science of computer programming 9(2), October 1987, pp. 137–160Google Scholar - [Bu85]Bruno Buchberger:
*Basic features and development of the critical-pair/completion procedure,*Proc. 1st int. conf. on rewriting techniques and applications, LNCS 202, Dijon, France, May 1985, pp. 1–45Google Scholar - [De85]Nachum Dershowitz:
*Termination,*Proc. 1st int. conf. on rewriting techniques and applications, LNCS 202, Dijon, France, May 1985, pp. 180–224Google Scholar - [De82]Nachum Dershowitz:
*Orderings for term rewriting systems,*J. theoretical computer science, Vol. 17, No. 3, March 1982, pp. 279–301Google Scholar - [Fa89]Christian Falter:
*User interface for softwaretools,*Internal report. Dept. of computer science, Univ. of Kaiserslautern, W. Germany, 1989, to appear (in German)Google Scholar - [Fe88]Roland Fettig:
*Dynamic multiset orderings for ground terms,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, May 1988 (in German)Google Scholar - [GB85]Jean H. Gallier, Ronald V. Book:
*Reductions in tree replacement systems,*Theoretical computer science 37, 1985, pp. 1–55Google Scholar - [Gr88]Bernhard Gramlich:
*Unification of term schemes — Theory and Applications,*SEKI-Report SR-88-12, Artificial intelligence laboratories, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, December 1988Google Scholar - [Hu81]Gerard Huet:
*A complete proof of correctness of the Knuth-Bendix completion algorithm,*J. computer and system science 23, 1981, pp. 11–21Google Scholar - [JLR82]Jean-Pierre Jouannaud, Pierre Lescanne, Fernand Reining:
*Recursive decomposition ordering*, I.F.I.P. Working conf. on formal description of programming concepts II (D. Bjørner, ed.), North Holland, Garmisch Partenkirchen, W. Germany, 1982, pp. 331–348Google Scholar - [KB70]Donald E. Knuth, Peter B. Bendix:
*Simple word problems in universal algebras,*Computational problems in abstract algebra (J. Leech, ed.), Pergamon Press, 1970, pp. 263–297Google Scholar - [KMN84]Deepak Kapur, David R. Musser, Paliath Narendran:
*Only prime superpositions need be considered in the Knuth-Bendix completion procedure,*J. symbolic computation 6, 1988, pp. 19–36Google Scholar - [KNS85]Deepak Kapur, Paliath Narendran, G. Sivakumar:
*A path ordering for proving termination of term rewriting systems,*Proc. 10th coll. on trees in algebra and programming, LNCS 185, 1985, pp. 173–187Google Scholar - [Ku85]Wolfgang Küchlin:
*A confluence criterion based on the generalized Newman lemma,*Proc. european conf. of computer algebra, Linz, 1985, pp. 390–399Google Scholar - [Ku82]Wolfgang Küchlin:
*Some reduction strategies for algebraic term rewriting,*SIGSAM Bulletin 16 (4), November 1982, pp. 13–23Google Scholar - [La79]Dallas Lankford:
*On proving term rewriting systems are noetherian,*Memo MTP-3, Mathematics dept., Louisiana tech. univ., Ruston, LA, May 1979Google Scholar - [MS86]Jürgen Müller, Joachim Steinbach:
*Topographical multiset orderings,*Proc. 10th German workshop and 2nd Austrian conf. on artificial intelligence, Ottenstein, Austria, September 1986, pp. 254–264 (in German)Google Scholar - [MSS89]Jürgen Müller, Andrea Sattler-Klein, Inger Sonntag:
*Comparison of subconnectedness criteria for term rewriting systems,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, 1989, to appearGoogle Scholar - [MW86]Jürgen Müller, Elvira Wagner:
*Efficient reduction strategies for term rewriting systems,*Proc. 10th German workshop and 2nd Austrian conf. on artificial intelligence, Ottenstein, Austria, September 1986, pp. 242–253 (in German)Google Scholar - [Pa89]Doerthe Paul:
*Implementing the ordering on polynomials,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, 1989, to appear (in German)Google Scholar - [P178]David A. Plaisted:
*A recursively defined ordering for proving termination of term rewriting systems,*Report UIUCDCS-R-78-943, Dept. of computer science, Univ. of Illinois, Urbana, IL, September 1978Google Scholar - [Sa89]Andrea Sattler-Klein:
*Critical pair criteria — comparison and improvement,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, 1989, to appearGoogle Scholar - [Sa88]Andrea Sattler-Klein:
*The SMOV-strategy — A strategy that can be used to complete a string rewriting system by the Knuth-Bendix algorithm,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, 1988Google Scholar - [Sa87]Andrea Sattler-Klein:
*Minimization of critical pairs in the completion system COSY,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, November 1987 (in German)Google Scholar - [So88]Inger Sonntag:
*Subconnectedness criteria — Implementation and comparison,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, Summer 1988 (in German)Google Scholar - [St89]Joachim Steinbach:
*COMTES — completion of term rewriting systems,*to appear as SEKI-Workingpaper, Univ. of Kaiserslautern, W. Germany, 1989 (in German)Google Scholar - [St88]Joachim Steinbach:
*Comparison of simplification orderings,*Proc. of the term rewriting workshop, Bristol, U.K., September 1988, to appearGoogle Scholar - [St88a]Joachim Steinbach:
*Term orderings with status,*SEKI-Report SR-88-12, Artificial intelligence laboratories, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, September 1988Google Scholar - [St88b]Joachim Steinbach:
*Comparison of simplification orderings,*SEKI-Report SR-88-02, Artificial intelligence laboratories, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, Feb. 1988Google Scholar - [St86]Joachim Steinbach:
*Orderings for term rewriting systems,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, June 1986 (in German)Google Scholar - [St83]Mark E. Stickel:
*A note on leftmost-innermost reduction,*SIGSAM Bulletin 17, 1983, pp. 19–20Google Scholar - [Wa86]Elvira Wagner:
*An extended Knuth-Bendix algorithm,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, June 1986 (in German)Google Scholar - [WB83]Franz Winkler, Bruno Buchberger:
*A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm,*Proc. coll. on algebra, combinatorics and logic in computer science, Györ, Hungary, 1983Google Scholar - [Wi84]Franz Winkler:
*The Church-Rosser property in computer algebra and special theorem proving: An investigation of critical pair completion algorithms,*Thesis, Univ. of Linz, Austria, 1984Google Scholar - [WS84]Elvira Wagner, Joachim Steinbach:
*Implementation of a basic version of the Knuth-Bendix completion algorithm,*Internal report, Dept. of computer science, Univ. of Kaiserslautern, W. Germany, Summer 1984 (in German)Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1989