On the expressibility of stable logic programming (Q4815033): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Smodels / rank | |||
Normal rank | |||
Revision as of 13:01, 28 February 2024
scientific article; zbMATH DE number 2092650
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
