Unification as a complexity measure for logic programming (Q3782840)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unification as a complexity measure for logic programming |
scientific article; zbMATH DE number 4045227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unification as a complexity measure for logic programming |
scientific article; zbMATH DE number 4045227 |
Statements
Unification as a complexity measure for logic programming (English)
0 references
1987
0 references
Turing computability
0 references
complexity measure
0 references
unification
0 references
Turing machines
0 references
Horn clause
0 references
computational completeness
0 references
hierarchy
0 references
logic programming
0 references
0.7766395211219788
0 references
0.7640877962112427
0 references
