On the complexity of identifying head-elementary-set-free programs (Q3400962): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:16, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of identifying head-elementary-set-free programs |
scientific article |
Statements
On the complexity of identifying head-elementary-set-free programs (English)
0 references
28 January 2010
0 references
computational complexity
0 references
elementary set
0 references
disjunctive logic program
0 references
head-elementary-set-free program
0 references
