@article{oai:nagoya.repo.nii.ac.jp:00028615,
 author = {Ishizuki, Sayaka and Oyamaguchi, Michio and Sakai, Masahiko},
 issue = {4},
 journal = {Applicable Algebra in Engineering, Communication and Computing},
 month = {Aug},
 note = {This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of the critical pairs is a necessary and sufficient condition. Using this condition, we give a decidable sufficient condition for confluence of innermost terminating systems. Finally, we enrich the condition by introducing the notion of left-stable rules. As a corollary, confluence of innermost terminating left-weakly-shallow TRSs is shown to be decidable., ファイル公開：2020/08/01},
 pages = {349--360},
 title = {Conditions for confluence of innermost terminating term rewriting systems},
 volume = {30},
 year = {2019}
}