Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Computer experiments with the REVE term rewriting system generator
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
On the descriptive power of term rewriting systems
Journal of Symbolic Computation
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
Rewrite method for theorem proving in first order theory with equality
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
A strong restriction of the inductive completion procedure
Journal of Symbolic Computation
On solving equations and disequations
Journal of the ACM (JACM)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The graph rewriting calculus: confluence and expressiveness
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
A term rewriting system for the calculus of moving surfaces
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |