The unification problem for confluent right-ground term rewriting systems.

DOI10.1016/S0890-5401(03)00022-1zbMath1054.68081MaRDI QIDQ1401934

Michio Oyamaguchi, Yoshikatsu Ohta

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Term rewriting systemsDecidabilityUnificationConfluenceRight-ground

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Murg term rewrite systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy narrowing: strong completeness and eager variable elimination
• A deterministic lazy narrowing calculus
• Syntacticness, cycle-syntacticness and shallow theories

This page was built for publication: The unification problem for confluent right-ground term rewriting systems.