On the Complexity of Answer Set Programming with Aggregates

DOI10.1007/978-3-540-72200-7_10MaRDI QIDQ5425401zbMATH OpenOpenAlexFDO

Authors Wolfgang Faber, N. Leone

Publication date 13 November 2007

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_10

Mathematics Subject Classification ID

Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Semantics and complexity of recursive aggregates in answer set programming
• Complexity and compilation of GZ-aggregates in answer set programming
• On Reductive Semantics of Aggregates in Answer Set Programming
• Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
• A Constructive semantic characterization of aggregates in answer set programming
• Aggregates in answer set optimization
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Complexity results for answer set programming with bounded predicate arities and implications
• Complexity results for probabilistic answer set programming
• Shared aggregate sets in answer set programming

Cited in

(19)

• Complexity results for answer set programming with bounded predicate arities and implications
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• On Cascade Products of Answer Set Programs
• Logic programs with propositional connectives and aggregates
• scientific article; zbMATH DE number 5996835 (Why is no real title available?)
• A Constructive semantic characterization of aggregates in answer set programming
• Design and implementation of aggregate functions in the DLV system
• On Reductive Semantics of Aggregates in Answer Set Programming
• Shared aggregate sets in answer set programming
• Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Complexity and compilation of GZ-aggregates in answer set programming
• Logic Programming
• AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Semantics and complexity of recursive aggregates in answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Ordered completion for logic programs with aggregates

Describes a project that uses

Uses Software

• ASSAT
• Cmodels

This page was built for publication: On the Complexity of Answer Set Programming with Aggregates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425401)