Pages that link to "Item:Q6488537"
From MaRDI portal
The following pages link to Some results on equational unification (Q6488537):
Displaying 20 items.
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Matching - a special case of unification? (Q582272) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- Unification in commutative rings is not finitary (Q916417) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Single versus simultaneous equational unification and equational unification for variable-permuting theories (Q1367080) (← links)
- Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- (Q3340122) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- (Q5090942) (← links)
- Term Rewriting and Applications (Q5703875) (← links)
- Term Rewriting and Applications (Q5703877) (← links)
- Variant-based equational anti-unification (Q6160760) (← links)
- Unification theory (Q6169561) (← links)
- Unification in a combination of equational theories: an efficient algorithm (Q6488538) (← links)
