Complexity and compilation of GZ-aggregates in answer set programming

DOI10.1017/S147106841500023XzbMath1379.68035arXiv1507.03922OpenAlexW3101449588MaRDI QIDQ4592998

Mario Alviano, Nicola Leone

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.03922

zbMATH Keywords

complexitycompilationanswer set programmingaggregates

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items

Recursive rules with aggregation: a simple unified semantics ⋮ Shared aggregate sets in answer set programming ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Multi-shot ASP solving with clingo ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages

Uses Software

• WASP
• f2lp

Cites Work

• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Logic programs with abstract constraint atoms: the role of computations
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• On the computational cost of disjunctive logic programming: Propositional case
• Combining answer set programming with description logics for the semantic web
• FLP answer set semantics without circular justifications for general logic programs
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Vicious Circle Principle and Logic Programs with Aggregates
• Anytime Computation of Cautious Consequences in Answer Set Programming
• Improving the Normalization of Weight Rules in Answer Set Programs
• Logic programs with propositional connectives and aggregates
• Well-founded and stable semantics of logic programs with aggregates
• A Constructive semantic characterization of aggregates in answer set programming
• Design and implementation of aggregate functions in the DLV system
• Some (in)translatability results for normal logic programs and propositional theories
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Complexity and compilation of GZ-aggregates in answer set programming