On the recursive decomposition ordering with lexicographical status and other related orderings-Reference-Cited by-同舟云学术

On the recursive decomposition ordering with lexicographical status and other related orderings

Published:1990-03 Issue:1 Volume:6 Page:39-49
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Lescanne Pierre

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00302640.pdf

Reference21 articles.

1. Dershowitz, N., ?Orderings of term-rewriting systems?, Theor. Comp. Sci. 17, 279?301 (1982).

2. Dershowitz, N., ?Termination of rewriting?, J. Symb. Comp. 3(1 & 2), 69?116 (1987).

3. Forgaard, R., ?A program for generating and analyzing term rewriting systems?, Tech. Report 343, Laboratory for Computer Science, Massachusetts Institute of Technology (1984). Master's Thesis.

4. Forgaard, R. and Detlefs, D., ?An incremental algorithm for proving termination of term rewriting systems?, in J.-P. Jouannaud (ed.), Proc. 1st Int. Conf. on Rewriting Techniques and Applications, pp. 255?270, Springer-Verlag (1985).

5. Harel, D., ?On folk theorems?, Commun. Assoc. Comp. Mach. 23(7), 379?389 (1980).

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

1. Equational Logic and Rewriting;Computational Logic;2014

2. Jumping and escaping: Modular termination and the abstract path ordering;Theoretical Computer Science;2012-12

3. On Lazy Commutation;Languages: From Formal to Natural;2009

4. Deciding the confluence of ordered term rewrite systems;ACM Transactions on Computational Logic;2003-01

5. Practical Algorithms for Deciding Path Ordering Constraint Satisfaction;Information and Computation;2002-11