swMATH10018MaRDI QIDQ21993FDOQ21993
Author name not available (Why is that?)
Official website: http://cl-informatik.uibk.ac.at/mkbtt/
Cited In (14)
- A lower bound of the number of rewrite rules obtained by homological methods
- NaTT
- Multi-completion with Termination Tools (System Description)
- Slothrop
- Formalizing Knuth-Bendix orders and Knuth-Bendix completion
- KBCV
- Nagoya Termination Tool
- term-rewriting
- REVE
- Well Quasi Orders
- Encoding dependency pair techniques and control strategies for maximal completion
- Title not available (Why is that?)
- Multi-completion with termination tools
- AC completion with termination tools
This page was built for software: mkbTT
