The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
From MaRDI portal
Publication:2851230
DOI10.1007/978-3-642-40564-8_7zbMATH Open1405.68036OpenAlexW50549667MaRDI QIDQ2851230FDOQ2851230
Publication date: 10 October 2013
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: http://eprints.hud.ac.uk/id/eprint/21032/1/lpnmr2013.pdf
Cited In (8)
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
- Anytime answer set optimization via unsatisfiable core shrinking
- Ordered completion for logic programs with aggregates
- Supportedly stable answer sets for logic programs with generalized atoms
- Shared aggregate sets in answer set programming
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
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 👍 👎
- Title not available (Why is that?) 👍 👎
- The complexity and generality of learning answer set programs 👍 👎
- Title not available (Why is that?) 👍 👎
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)
