Complexity and undecidability results for logic programming (Q1924779): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and undecidability results for logic programming |
scientific article |
Statements
Complexity and undecidability results for logic programming (English)
0 references
25 March 1997
0 references
degree of uncomputability
0 references
expressive power
0 references
