The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

DOI10.1007/978-3-642-40564-8_7zbMATH Open1405.68036OpenAlexW50549667MaRDI QIDQ2851230FDOQ2851230

Authors: M. Alviano, Wolfgang Faber 

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Cited In (10)

• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Anytime answer set optimization via unsatisfiable core shrinking
• Ordered completion for logic programs with aggregates
• FLP answer set semantics without circular justifications for general logic programs
• Unsatisfiable core analysis and aggregates for optimum stable model search
• Chain answer sets for logic programs with generalized atoms
• 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

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)