Two-restricted one context unification is in polynomial time (Q5351971)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6767609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-restricted one context unification is in polynomial time |
scientific article; zbMATH DE number 6767609 |
Statements
31 August 2017
0 references
context unification
0 references
first-order unification
0 references
deduction
0 references
type checking
0 references
Two-Restricted One Context Unification is in Polynomial Time (English)
0 references
0.8891226649284363
0 references
0.8043659925460815
0 references
0.7999200820922852
0 references
0.7881799340248108
0 references
0.7671611905097961
0 references
