The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
From MaRDI portal
Publication:2851230
Recommendations
- Complexity results for answer set programming with bounded predicate arities and implications
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Chain answer sets for logic programs with generalized atoms
- Supportedly stable answer sets for logic programs with generalized atoms
- Semantical characterizations and complexity of equivalences in answer set programming
- FLP answer set semantics without circular justifications for general logic programs
- On the Complexity of Answer Set Programming with Aggregates
- scientific article; zbMATH DE number 6261542
- The complexity and generality of learning answer set programs
- scientific article; zbMATH DE number 140407
Cited in
(10)- Shared aggregate sets in answer set programming
- Chain answer sets for logic programs with generalized atoms
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- FLP answer set semantics without circular justifications for general logic programs
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Anytime answer set optimization via unsatisfiable core shrinking
- Supportedly stable answer sets for logic programs with generalized atoms
- Ordered completion for logic programs with aggregates
This page was built for publication: The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851230)