Semantics and complexity of recursive aggregates in answer set programming (Q543600): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(6 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NoMoRe / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Datalog / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: ASSAT / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Cmodels / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: nomore++ / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064864283 / rank | |||
Normal rank |
Revision as of 23:02, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semantics and complexity of recursive aggregates in answer set programming |
scientific article |
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