swMATH21588MaRDI QIDQ33393FDOQ33393
Author name not available (Why is that?)
Official website: https://link.springer.com/chapter/10.1007%2F978-3-319-08918-8_32
Cited In (29)
- WANDA
- 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
- NaTT
- Relative termination via dependency pairs
- On probabilistic term rewriting
- AC dependency pairs revisited
- CeTA
- Tyrolean
- CSI
- CoLoR
- mkbTT
- IsaFoR
- Matchbox
- Slothrop
- Saigawa
- TPDB
- TPA
- CoLL
- KBCV
- ConCon
- term-rewriting
- CoCoWeb
- Cops
- REVE
- KoAT
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
This page was built for software: Nagoya Termination Tool
