Semantics and complexity of recursive aggregates in answer set programming (Q543600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5909444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semantics and complexity of recursive aggregates in answer set programming |
scientific article; zbMATH DE number 5909444 |
Statements
Semantics and complexity of recursive aggregates in answer set programming (English)
0 references
17 June 2011
0 references
nonmonotonic reasoning
0 references
answer set programming
0 references
aggregates
0 references
computational complexity
0 references
0.9721693396568298
0 references
0.9299787282943726
0 references
0.8249242901802063
0 references
0.8216466903686523
0 references
0.8197287321090698
0 references
