Semantical characterizations and complexity of equivalences in answer set programming (Q5277782)
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: Semantical characterizations and complexity of equivalences in answer set programming |
scientific article; zbMATH DE number 6744025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semantical characterizations and complexity of equivalences in answer set programming |
scientific article; zbMATH DE number 6744025 |
Statements
Semantical characterizations and complexity of equivalences in answer set programming (English)
0 references
12 July 2017
0 references
answer set semantics
0 references
computational complexity
0 references
program optimization
0 references
stable models
0 references
strong equivalence
0 references
uniform equivalence
0 references
