Matching - a special case of unification?

DOI10.1016/S0747-7171(89)80057-4zbMath0691.03004OpenAlexW2083402938MaRDI QIDQ582272

Hans-Jürgen Bürckert

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80057-4

zbMATH Keywords

matchingdecidabilityequational theorycollapse-free theoriesvariable-restricted unification

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items

Modular higher-order E-unification, Some independence results for equational unification, Equational unification, word unification, and 2nd-order equational unification, Combining matching algorithms: The regular case, Reduction rules for resolution-based systems, Unification of concept terms in description logics, Unification in a combination of arbitrary disjoint equational theories, Competing for the \(AC\)-unification race

Cites Work

• Equational problems and disunification
• Complete sets of unifiers and matchers in equational theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item