Pages that link to "Item:Q582141"
From MaRDI portal
The following pages link to An almost linear Robinson unification algorithm (Q582141):
Displaying 12 items.
- A practical unification algorithm (Q751312) (← links)
- About the Paterson-Wegman linear unification algorithm (Q1103417) (← links)
- A practically efficient and almost linear unification algorithm (Q1105360) (← 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)
- A Robin algorithm for unilateral contact problems (Q2476548) (← links)
- Source-tracking unification (Q2568436) (← links)
- Fast algorithms for uniform semi-unification (Q2643520) (← links)
- Verification of the Completeness of Unification Algorithms à la Robinson (Q4931594) (← links)
- The negation elimination from syntactic equational formula is decidable (Q5055804) (← links)
- Efficient tree pattern unification (Q6560197) (← links)