Similar Items: Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
- Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
- Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms
- Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- Small Term Reachability and Related Problems for Terminating Term Rewriting Systems