Unification as a complexity measure for logic programming (Q3782840): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:40, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unification as a complexity measure for logic programming |
scientific article |
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
