Author:
Bachmair Leo,Dershowitz Nachum
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bachmair, L., and Plaisted, D.A. (1985). Termination orderings for associative-commutative rewriting systems, J. of Symbolic Computation 1, 329–349.
2. Ben Cherifa, A., and Lescanne, P. (1985). A method for proving termination of rewriting systems based on elementary computations on polynomials, unpublished manuscript.
3. Lect. Notes in Comp. Science;N. Dershowitz,1981
4. Dershowitz, N. (1982). Orderings for term-rewriting systems, Theoretical Computer Science 17, 279–301.
5. Dershowitz, N. (1985a). Computing with rewrite systems, Information and Control 64, 122–157.
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Allegories of Symbolic Manipulations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Termination of Graph Transformation Systems Using Weighted Subgraph Counting;Graph Transformation;2023
3. Finding small counterexamples for abstract rewriting properties;Mathematical Structures in Computer Science;2018-07-25
4. Well-Founded Unions;Automated Reasoning;2018
5. Algebraic Notions of Termination;Logical Methods in Computer Science;2011-02-11