Pages that link to "Item:Q1099652"
From MaRDI portal
The following pages link to Unification in combinations of collapse-free regular theories (Q1099652):
Displaying 11 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Combining matching algorithms: The regular case (Q1186723) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- An overview of LP, the Larch Prover (Q5055717) (← links)
- Combining matching algorithms: The regular case (Q5055731) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- Second-order unification in the presence of linear shallow algebraic equations (Q5881305) (← links)
