Extension of the associative path ordering to a chain of associative commutative symbols-Reference-Cited by-同舟云学术

Extension of the associative path ordering to a chain of associative commutative symbols

Published:1993 Issue: Volume: Page:389-404
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Delor Catherine,Puel Laurence

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56868-9_29.pdf

Reference10 articles.

1. Leo Bachmair. Proof Methods for Equational Theories. PhD thesis, University of Illinois at Urbana-Champaign, 1987.

2. Leo Bachmair. Associative-commutative reduction orderings. Info Proc. Letters, 1992.

3. Leo Bachmair and Nachum Dershowitz. Commutation, transformation, and termination. In Jorg H. Siekmann, editor, Proc. 8th Int. Conf. on Automated Deduction, Oxford, England, LNCS 230, pages 5–20, July 1986.

4. Leo Bachmair and Nachum Dershowitz. Completion for rewriting modulo a congruence. In Pierre Lescanne, editor, Proceedings of the Second International Conference on Rewriting Techniques and Applications, pages 192–203, Bordeaux, France, May 1987. Vol. 256 of Lecture Notes in Computer Science, Springer, Berlin.

5. Leo Bachmair and David A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1(4):329–349, December 1985.

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

1. Tableaux for Lattices;Algebraic Methodology and Software Technology;2006

2. Monotonic AC-Compatible Semantic Path Orderings;Rewriting Techniques and Applications;2003

3. A Fully Syntactic AC-RPO;Information and Computation;2002-11

4. Knuth-Bendix Completion for Non-Symmetric Transitive Relations;Electronic Notes in Theoretical Computer Science;2001-11

5. Dependency Pairs for Equational Rewriting;Rewriting Techniques and Applications;2001