Cited in
(29)- Confluence by critical pair analysis revisited
- Tuple interpretations for termination of term rewriting
- Term orderings for non-reachability of (conditional) rewriting
- Reducing relative termination to dependency pair problems
- Relative termination via dependency pairs
- On probabilistic term rewriting
- CeTA
- Tyrolean
- CSI
- CoLoR
- mkbTT
- IsaFoR
- Matchbox
- Slothrop
- Saigawa
- TPDB
- TPA
- CoLL
- KBCV
- ConCon
- term-rewriting
- CoCoWeb
- Cops
- REVE
- KoAT
- AC dependency pairs revisited
- WANDA
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- NaTT
This page was built for software: Nagoya Termination Tool
