Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
On Automating Inductive and Non-inductive Termination Methods
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Solved Forms for Path Ordering Constraints
RtA '99 Proceedings of the 10th 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
Languages: From Formal to Natural
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Simplification Orderings: History Of Results
Fundamenta Informaticae
Hi-index | 0.00 |