Improving transformation systems for general E-unification

DOI10.1007/978-3-662-21551-7_8zbMath1503.68141OpenAlexW1511254734MaRDI QIDQ5055788

Max Moser

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_8

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (3)

General \(E\)-unification with eager variable elimination and a nice cycle rule ⋮ Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) ⋮ Lazy narrowing: strong completeness and eager variable elimination

Cites Work

• A proof theory for general unification
• Complete sets of transformations for general E-unification
• Basic narrowing revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving transformation systems for general E-unification