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

DOI10.1007/978-3-642-40564-8_7zbMath1405.68036OpenAlexW50549667MaRDI QIDQ2851230

Wolfgang Faber, Mario Alviano

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

Mathematics Subject Classification ID

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

Related Items (8)

Supportedly stable answer sets for logic programs with generalized atoms ⋮ Shared aggregate sets in answer set programming ⋮ Ordered completion for logic programs with aggregates ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

This page was built for publication: The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics