Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
On ground-confluence of term rewriting systems
Information and Computation
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Modularity of confluence: a simplified proof
Information Processing Letters
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Modular termination of r-consistent and left-linear term rewriting systems
Theoretical Computer Science
Term rewriting and all that
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Algorithms and Reductions for Rewriting Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
New Undecidablility Results for Finitely Presented Monoids
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Relative Undecidability in Term Rewriting
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Levels of undecidability in rewriting
Information and Computation
Processes, Terms and Cycles
Hi-index | 0.00 |
For a hierarchy of properties of term rewriting systems related to confluence we prove relative undecidability, i.e., for implications X ↠ Y in the hierarchy the property X is undecidable for term rewriting systems satisfying Y. For some of the implications either X or -X is semi-decidable, for others neither X nor -X is semi-decidable. We prove most of these results for linear term rewrite systems.