@article{oai:nagoya.repo.nii.ac.jp:00007647,
 author = {UCHIYAMA, Keita and SAKAI, Masahiko and NISHIDA, Naoki and SAKABE, Toshiki and KUSAKARI, Keiichirou},
 journal = {数理解析研究所講究録},
 month = {May},
 note = {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.},
 pages = {166--170},
 title = {Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems},
 volume = {1554},
 year = {2007}
}