Pages that link to "Item:Q1820760"

The following pages link to Complete sets of unifiers and matchers in equational theories (Q1820760):

Displaying 38 items.

• Unification in commutative theories (Q582071) (← links)
• Order-sorted unification (Q582269) (← links)
• Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
• Matching - a special case of unification? (Q582272) (← links)
• Conditional equational theories and complete sets of transformations (Q918541) (← links)
• Unification in varieties of idempotent semigroups (Q1092171) (← links)
• A note on unification type zero (Q1098285) (← links)
• Associative-commutative unification (Q1099648) (← links)
• Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
• The unification hierarchy is undecidable (Q1181721) (← links)
• An improved general \(E\)-unification method (Q1201347) (← links)
• Completion for rewriting modulo a congruence (Q1262752) (← links)
• Complete sets of transformations for general E-unification (Q1262754) (← links)
• Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
• Semi-unification of two terms in Abelian groups (Q1336738) (← links)
• Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
• On equational theories, unification, and (un)decidability (Q1825184) (← links)
• Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
• Variadic equational matching in associative and commutative theories (Q2029000) (← links)
• Anti-unification and the theory of semirings (Q2215964) (← links)
• What Is Essential Unification? (Q3305325) (← links)
• (Q3340122) (← links)
• The undecidability of the D_A-unification problem (Q3478395) (← links)
• Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
• Characterizations of unification type zero (Q5055707) (← links)
• Rewriting, and equational unification: the higher-order cases (Q5055746) (← links)
• Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
• Unification properties of commutative theories: A categorical treatment (Q5096265) (← links)
• The complexity of counting problems in equational matching (Q5210797) (← links)
• (Q5858677) (← links)
• Solving word equations (Q5899816) (← links)
• Solving word equations (Q5916475) (← links)
• Implementation of Makanin's Algorithm (Q6114506) (← links)
• Complete equational unification based on an extension of the Knuth-Bendix completion procedure (Q6114511) (← links)
• Complete sets of reductions with constraints (Q6488546) (← links)
• Higher order E-unification (Q6488561) (← links)
• Retrieving library identifiers via equational matching of types (Q6488563) (← links)
• Unification in monoidal theories (Q6488564) (← links)