On the Complexity of Answer Set Programming with Aggregates

DOI10.1007/978-3-540-72200-7_10zbMath1149.68329OpenAlexW1539967703MaRDI QIDQ5425401

Wolfgang Faber, Nicola 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

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

Related Items (1)

Ordered completion for logic programs with aggregates

Uses Software

• ASSAT
• Cmodels

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