Cited in
(14)- AC completion with termination tools
- A lower bound of the number of rewrite rules obtained by homological methods
- Multi-completion with Termination Tools (System Description)
- Slothrop
- KBCV
- Nagoya Termination Tool
- term-rewriting
- REVE
- Well Quasi Orders
- Formalizing Knuth-Bendix orders and Knuth-Bendix completion
- Encoding dependency pair techniques and control strategies for maximal completion
- scientific article; zbMATH DE number 6027911 (Why is no real title available?)
- Multi-completion with termination tools
- NaTT
This page was built for software: mkbTT
