Matching - a special case of unification?

DOI10.1016/S0747-7171(89)80057-4zbMATH Open0691.03004OpenAlexW2083402938MaRDI QIDQ582272FDOQ582272

Authors: 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

Recommendations

• Some results on equational unification
• The undecidability of the unification and matching problem for canonical theories
• Single versus simultaneous equational unification and equational unification for variable-permuting theories
• Combining decision algorithms for matching in the union of disjoint equational theories
• Complete sets of unifiers and matchers in equational theories

zbMATH Keywords

matchingdecidabilityequational theorycollapse-free theoriesvariable-restricted unification

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equational problems and disunification
• Complete sets of unifiers and matchers in equational theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Title not available (Why is that?)
• Unification of concept terms in description logics
• Complexity of nilpotent unification and matching problems.
• Equational unification, word unification, and 2nd-order equational unification
• Unification in a combination of arbitrary disjoint equational theories
• Tractable and intractable second-order matching problems
• Combining matching algorithms: The regular case
• Complete sets of unifiers and matchers in equational theories
• Unification in a combination of equational theories: an efficient algorithm
• Reduction rules for resolution-based systems
• Title not available (Why is that?)
• Competing for the \(AC\)-unification race
• Modular higher-order E-unification
• Some independence results for equational unification

This page was built for publication: Matching - a special case of unification?

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