Pages that link to "Item:Q6488538"
From MaRDI portal
The following pages link to Unification in a combination of equational theories: an efficient algorithm (Q6488538):
Displaying 20 items.
- Efficient general AGH-unification (Q462489) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- Combining unification algorithms (Q1329186) (← links)
- Three systems for cryptographic protocol analysis (Q1330137) (← links)
- Single versus simultaneous equational unification and equational unification for variable-permuting theories (Q1367080) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Unification in the union of disjoint equational theories: Combining decision procedures (Q1918503) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- (Q3340122) (← links)
- Formal synthesis of a unification algorithm by the deductive-tableau method (Q3835052) (← links)
- (Q3991208) (← links)
- SAT Encoding of Unification in $\mathcal{EL}$ (Q4933298) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- More problems in rewriting (Q5055812) (← links)
- Term Rewriting and Applications (Q5703875) (← links)
- Unification theory (Q6169561) (← links)