Semantical characterizations and complexity of equivalences in answer set programming (Q5277782): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971626643 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0502078 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:51, 20 April 2024
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
