On the complexity of identifying head-elementary-set-free programs (Q3400962): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reasoning with minimal models: efficient algorithms and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Propositional semantics for disjunctive logic programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Head-Elementary-Set-Free Logic Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The DLV system for knowledge representation and reasoning / rank | |||
Normal rank | |||
Latest revision as of 10:46, 2 July 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
