Persistence of Termination for Term Rewriting Systems with Ordered Sorts. - Munehiro Iwami (Artificial Intelligence and Applications, 2005)

Persistence of Termination for Right-Linear Overlay Term Rewriting Systems. - Munehiro Iwami (Artificial Intelligence and Applications, 2005)

Persistence of Semi-Completeness for Term Rewriting Systems. - Munehiro Iwami (Artificial Intelligence and Applications, 2005)

An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited. - Munehiro Iwami (LAPTEC, 2005)

Termination of Rule-Based Calculi for Uniform Semi-Unification. - Takahito Aoto 001; Munehiro Iwami (LATA, 2013)

Commutative Rational Term Rewriting. - Mamoru Ishizuka; Takahito Aoto 001; Munehiro Iwami (LATA, 2021)

Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata. - Keisuke Nakano 001; Munehiro Iwami (CIAA, 2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version). - Keisuke Nakano 001; Munehiro Iwami (CoRR, 2024)