General \(E\)-unification with eager variable elimination and a nice cycle rule

DOI10.1007/s10817-007-9068-zzbMath1118.68155OpenAlexW2019945092MaRDI QIDQ2642468

Barbara Morawska

Publication date: 17 August 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-007-9068-z

zbMATH Keywords

E-unificationCycle ruleVariable elimination

Mathematics Subject Classification ID

Cites Work

• Lazy narrowing: strong completeness and eager variable elimination
• An improved general \(E\)-unification method
• Complete sets of transformations for general E-unification
• Foundations of equational logic programming
• An Efficient Unification Algorithm
• Term Rewriting and All That
• Improving transformation systems for general E-unification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General \(E\)-unification with eager variable elimination and a nice cycle rule