Similar Items: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
- Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
- Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
- Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
- Infinitary Combinatory Reduction Systems: Confluence
- Certifying Confluence Proofs via Relative Termination and Rule Labeling
- From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity