Pages that link to "Item:Q1105360"
From MaRDI portal
The following pages link to A practically efficient and almost linear unification algorithm (Q1105360):
Displaying 22 items.
- Efficient general AGH-unification (Q462489) (← links)
- An almost linear Robinson unification algorithm (Q582141) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- A practical unification algorithm (Q751312) (← links)
- About the Paterson-Wegman linear unification algorithm (Q1103417) (← links)
- Stable unmerging in linear time and constant space (Q1108017) (← links)
- Lazy linear combinatorial unification (Q1284282) (← links)
- An algorithm for the retrieval of unifiers from discrimination trees (Q1382150) (← links)
- An ordering linear unification algorithm (Q1824410) (← links)
- Faster linear unification algorithm (Q2102937) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Source-tracking unification (Q2568436) (← links)
- Unifying F-logic molecules: a rectification to the original unification algorithm (Q2826037) (← links)
- Rational unification in 28 characters (Q2848116) (← links)
- First-order unification using variable-free relational algebra (Q2889575) (← links)
- (Q3722253) (← links)
- On uniformization of affine dependence algorithms (Q4420883) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- (Q5020994) (← links)
- Implementation of a UU-algorithm for primitive recursive tree functions (Q5055894) (← links)
- Automated Deduction – CADE-19 (Q5900733) (← links)
- Automata-driven efficient subterm unification (Q5940920) (← links)