@article{oai:nagoya.repo.nii.ac.jp:00007548,
 author = {Uchiyama, Keita and Sakai, Masahiko and Sakabe, Toshiki},
 journal = {Proceedings of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007) Paris},
 month = {Jun},
 note = {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 μ-termination are decidable properties for the class of semi-constructor TRSs.},
 pages = {16--27},
 title = {Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems},
 year = {2007}
}