Computationally hard problems for logic programs under answer set semantics (Q6636616)
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: Computationally hard problems for logic programs under answer set semantics |
scientific article; zbMATH DE number 7942534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computationally hard problems for logic programs under answer set semantics |
scientific article; zbMATH DE number 7942534 |
Statements
Computationally hard problems for logic programs under answer set semantics (English)
0 references
12 November 2024
0 references
exponential lower bound
0 references
logic programs
0 references
answer set semantics
0 references
propositional formulas
0 references
succinctness
0 references
