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

Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
• Keywords: Decidable Property, ENTCS 2008, Right Ground Term, Term Rewriting Systems