Associative path orderings-Reference-Cited by-同舟云学术

Associative path orderings

Published:1985 Issue: Volume: Page:241-254
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Bachmair Leo,Plaisted David A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15976-2_11.pdf

Reference15 articles.

1. L. Bachmair, Termination orderings for associative commutative rewriting systems, Report UIUCDCS-R-84-1179, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, December 1984.

2. N. Dershowitz, A note on simplification orderings. Information Processing Letters 9 (1979), 212–215.

3. N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science 17 (1982), 279–301.

4. N. Dershowitz, J. Hsiang, N.A. Josephson and D.A. Plaisted, Associative-commutative rewriting. Proc. 8th IJCAI, Karlsruhe, 1983, 990–994.

5. J. Hsiang, Topics in automated theorem proving and program generation, Ph. D. thesis, Univ. of Illinois at Urbana-Champaign, 1983.

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

1. Predicate Completion for non-Horn Clause Sets;Lecture Notes in Computer Science;2011

2. Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism;Rewriting Techniques and Applications;2003

3. An AC-Compatible Knuth-Bendix Order;Automated Deduction – CADE-19;2003

4. Positive deduction modulo regular theories;Computer Science Logic;1996

5. A term equality problem equivalent to graph isomorphism;Information Processing Letters;1994-07