Unification as a complexity measure for logic programming (Q3782840): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(87)90014-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021929022 / rank | |||
Normal rank | |||
Latest revision as of 23:11, 19 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
