Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
On using ground joinable equations in equational theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Information Processing Letters
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Processes, Terms and Cycles
Confluence of graph transformation revisited
Processes, Terms and Cycles
| Hi-index | 0.00 |