Munehiro Iwami

According to our database, Munehiro Iwami authored at least 8 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version).

Keisuke Nakano, Munehiro Iwami

CoRR, 2024

Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata.

Keisuke Nakano, Munehiro Iwami

Proceedings of the Implementation and Application of Automata, 2024

2021

Commutative Rational Term Rewriting.

Mamoru Ishizuka, Takahito Aoto, Munehiro Iwami

Proceedings of the Language and Automata Theory and Applications, 2021

2013

Termination of Rule-Based Calculi for Uniform Semi-Unification.

Takahito Aoto, Munehiro Iwami

Proceedings of the Language and Automata Theory and Applications, 2013

2005

An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited.

Munehiro Iwami

Proceedings of the Advances in Logic Based Intelligent Systems, 2005

Persistence of Semi-Completeness for Term Rewriting Systems.

Munehiro Iwami

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

Persistence of Termination for Right-Linear Overlay Term Rewriting Systems.

Munehiro Iwami

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

Persistence of Termination for Term Rewriting Systems with Ordered Sorts.

Munehiro Iwami

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005