AC-Termination of rewrite systems: A modified Knuth-Bendix ordering-Reference-Cited by-同舟云学术

AC-Termination of rewrite systems: A modified Knuth-Bendix ordering

Published:1990 Issue: Volume: Page:372-386
ISSN:0302-9743
Container-title:Algebraic and Logic Programming
language:
Short-container-title:

Author:

Steinbach Joachim

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53162-9_52.pdf

Reference26 articles.

1. 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–160

2. Leo Bachmair / David A. Plaisted: Termination orderings for associative-commutative rewriting systems, Journal of Symbolic Computation 1, 1985, pp. 329–349

3. Max Dauchet: Termination of rewriting is undecidable in the one-rule case, Proc. 13th Symposium of Mathematical Foundations of Computer Science, Carlsbad, CSFR, September 1988, LNCS 324, pp. 262–270

4. Nachum Dershowitz: Termination of rewriting, Journal of Symbolic Computation 3, 1987, pp. 69–116

5. Nachum Dershowitz / Jieh Hsiang / N. Alan Josephson / David A. Plaisted: Associative-commutative rewriting, Proc. 8th International Joint Conference on Artificial Intelligence, Karlsruhe. W. Germany, August 1983, pp. 940–944

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AC-KBO revisited;Theory and Practice of Logic Programming;2015-06-08

2. AC-KBO Revisited;Functional and Logic Programming;2014

3. Extension of the associative path ordering to a chain of associative commutative symbols;Rewriting Techniques and Applications;1993

4. Extension of the associative path ordering to a chain of associative commutative symbols;Rewriting Techniques and Applications;1993

5. Any ground associative-commutative theory has a finite canonical system;Rewriting Techniques and Applications;1991