Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997)
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: Rewriting recursive aggregates in answer set programming: back to monotonicity |
scientific article; zbMATH DE number 6804560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rewriting recursive aggregates in answer set programming: back to monotonicity |
scientific article; zbMATH DE number 6804560 |
Statements
Rewriting recursive aggregates in answer set programming: back to monotonicity (English)
0 references
9 November 2017
0 references
answer set programming
0 references
polynomial
0 references
faithful and modular translation
0 references
aggregation functions
0 references
0 references
0.8262749314308167
0 references
0.8249242901802063
0 references
0.8062016367912292
0 references
0.7811661958694458
0 references
0.7599204182624817
0 references
