Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

DOI10.3233/FI-2016-1441MaRDI QIDQ4589242zbMATH OpenOpenAlexFDO

Authors M. Alviano

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1441

zbMATH Keywords

aggregation functionsanswer set programmingnon-convex recursive aggregates

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30)

Recommendations

• On the Complexity of Answer Set Programming with Aggregates
• Semantics and complexity of recursive aggregates in answer set programming
• Aggregates in answer set optimization
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• A Constructive semantic characterization of aggregates in answer set programming
• A multiparametric view on answer set programming
• On Reductive Semantics of Aggregates in Answer Set Programming
• Complexity and compilation of GZ-aggregates in answer set programming
• The power of non-ground rules in Answer Set Programming

Cited in

(9)

• Recursive rules with aggregation: a simple unified semantics
• On Reductive Semantics of Aggregates in Answer Set Programming
• Shared aggregate sets in answer set programming
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• The power of non-ground rules in Answer Set Programming
• Inlining external sources in answer set programs
• Unsatisfiable core analysis and aggregates for optimum stable model search
• On the Complexity of Answer Set Programming with Aggregates

This page was built for publication: Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

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