Pages that link to "Item:Q3833654"
From MaRDI portal
The following pages link to Unification: a multidisciplinary survey (Q3833654):
Displayed 24 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- A graph unification machine for NL parsing (Q597235) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Verification conditions are code (Q855274) (← links)
- Semantic networks (Q1202620) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- The Kreisel length-of-proof problem (Q1353977) (← links)
- Relaxed unification -- proposal (Q1431877) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Analogical program derivation based on type theory (Q1802072) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- Source-tracking unification (Q2568436) (← links)
- GUBS a Language for Synthetic Biology: Specification and Compilation (Q2945531) (← links)
- On the Parameterized Complexity of Associative and Commutative Unification (Q2946004) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- (Q3994022) (← links)
- (Q4580325) (← links)
- Graph unification and matching (Q4645268) (← links)
- E-Unification based on Generalized Embedding (Q5084482) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading (Q5372007) (← links)
- A (machine-oriented) logic based on pattern matching (Q6149946) (← links)
- Unification theory (Q6169561) (← links)
- Model-theoretic aspects of unification (Q6169563) (← links)