An improved general \(E\)-unification method

DOI10.1016/0747-7171(92)90010-2zbMath0773.68063OpenAlexW2026690672MaRDI QIDQ1201347

Patricia Johann, Daniel J. Dougherty

Publication date: 17 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0747-7171(92)90010-2

zbMATH Keywords

paramodulation

Mathematics Subject Classification ID

Related Items (3)

General \(E\)-unification with eager variable elimination and a nice cycle rule ⋮ Characterizing functions mappable over GADTs ⋮ A refined version of general E-unification

Cites Work

• Complete sets of transformations for general E-unification
• Complete sets of unifiers and matchers in equational theories
• An Efficient Unification Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved general \(E\)-unification method