Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
Simplification Orderings: History Of Results
Fundamenta Informaticae
Hi-index | 0.00 |