Pages that link to "Item:Q2851230"
From MaRDI portal
The following pages link to The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230):
Displaying 8 items.
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
- Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
