Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

DOI10.1016/j.entcs.2008.03.051zbMath1279.68122OpenAlexW2155880381MaRDI QIDQ2873675

Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.051

zbMATH Keywords

innermost terminationdependency paircontext-sensitive termination

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Uses Software

• TPDB

Cites Work

• Unnamed Item
• Proving termination of context-sensitive rewriting by transformation
• Decidability for left-linear growing term rewriting systems.
• Termination of term rewriting using dependency pairs
• Improving the Context-sensitive Dependency Graph
• Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
• Context-Sensitive Dependency Pairs
• Automated Deduction – CADE-20
• Termination of Rewriting with Right-Flat Rules
• Rewriting Techniques and Applications

This page was built for publication: Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems