Pages that link to "Item:Q5425401"
From MaRDI portal
The following pages link to On the Complexity of Answer Set Programming with Aggregates (Q5425401):
Displaying 7 items.
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230) (← links)
- On Cascade Products of Answer Set Programs (Q2931275) (← links)
- (Q3112638) (← links)
- On Reductive Semantics of Aggregates in Answer Set Programming (Q3643117) (← links)
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates (Q4589242) (← links)
- AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems (Q5392073) (← links)