On the longest perpetual reductions in orthogonal expression reduction systems
Theoretical Computer Science
Algorithms and reductions for rewriting problems. II
Information Processing Letters
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
A new decidability technique for ground term rewriting systems with applications
ACM Transactions on Computational Logic (TOCL)
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Termination of rewriting with right-flat rules
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Constructing rewrite-based decision procedures for embeddings and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Simplification Orderings: History Of Results
Fundamenta Informaticae
| Hi-index | 0.00 |