On the expressibility of stable logic programming (Q4815033)
From MaRDI portal
!
WARNING
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 2092650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the expressibility of stable logic programming |
scientific article; zbMATH DE number 2092650 |
Statements
On the expressibility of stable logic programming (English)
0 references
19 August 2004
0 references
Answer Set Programming
0 references
Turing machines
0 references
expressibility.
0 references
1.0000001
0 references
0.9599551
0 references
0.9496247
0 references
0.9205327
0 references
0.9194187
0 references
0.91903937
0 references
0.9160855
0 references
0.91464126
0 references
