Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
Keita Uchiyama, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, Keiichirou Kusakari · Institutional Repositories DataBase (IRDB) · 2007
Yi and Sakai [7] showed that the termination problem is decidable for a class of semiconstructor term rewriting systems, which is a supurclass 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 [7] to show that innermost termination is decidable for the class of semi-constructor TRSs.