Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
A New Termination Approach for Specialization
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
On Automating Inductive and Non-inductive Termination Methods
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Improving Homeomorphic Embedding for Online Termination
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Ordinals and knuth-bendix orders
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modularity in term rewriting revisited
Theoretical Computer Science
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |