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

DOI10.1016/S0890-5401(03)00022-1MaRDI QIDQ1401934zbMATH OpenFDO

Authors Michio Oyamaguchi, Yoshikatsu Ohta

Publication date 19 August 2003

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

Full work available at URL https://doi.org/10.1016/S0890-5401(03)00022-1

zbMATH Keywords

ConfluenceDecidabilityRight-groundTerm rewriting systemsUnification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1722710
• Rewriting Techniques and Applications
• On ground-confluence of term rewriting systems
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 3928342

Cites work

• A deterministic lazy narrowing calculus
• scientific article; zbMATH DE number 1189060 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• Lazy narrowing: strong completeness and eager variable elimination
• Syntacticness, cycle-syntacticness and shallow theories

Cited in

(5)

• A class of confluent term rewriting systems and unification
• Unification of drags and confluence of drag rewriting
• scientific article; zbMATH DE number 1722710 (Why is no real title available?)
• Rewriting Techniques and Applications
• Murg term rewrite systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401934)