The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics |
scientific article; zbMATH DE number 6214647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics |
scientific article; zbMATH DE number 6214647 |
Statements
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (English)
0 references
10 October 2013
0 references
0.8919776
0 references
0.88368237
0 references
0.88071203
0 references
0.8741127
0 references
0 references
0.8656348
0 references
0.86511385
0 references
0.86378855
0 references
