Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference3 articles.
1. Termination of rewriting;Dershowitz;J. Symbolic Computation,1987
2. Proving termination with multiset orderings;Dershowitz;Comm. ACM,1979
3. On multiset orderings;Jouannaud;Inform. Process. Lett.,1982
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Properties of Multiset Orders by Minimal and Maximal Submultisets;2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2015-09
2. Leanest quasi-orderings;Information and Computation;2007-04
3. Leanest Quasi-orderings;Lecture Notes in Computer Science;2005
4. New Directions for Syntactic Termination Orderings;Symbolic Rewriting Techniques;1998
5. A geometrical approach to multiset orderings;Theoretical Computer Science;1989-09