Rewriting recursive aggregates in answer set programming: back to monotonicity

DOI10.1017/S1471068415000228zbMath1379.68034arXiv1507.03923OpenAlexW3104110719MaRDI QIDQ4592997

Martin Gebser, Wolfgang Faber, Mario Alviano

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.03923

zbMATH Keywords

polynomialaggregation functionsanswer set programmingfaithful and modular translation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

Recursive rules with aggregation: a simple unified semantics ⋮ Shared aggregate sets in answer set programming ⋮ Solution Enumeration by Optimality in Answer Set Programming ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Enhancing Magic Sets with an Application to Ontological Reasoning ⋮ Multi-shot ASP solving with clingo ⋮ Inlining External Sources in Answer Set Programs ⋮ ASP-Core-2 Input Language Format ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages

Uses Software

• Gringo
• DLV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz
• Semantics and complexity of recursive aggregates in answer set programming
• Answer set programming based on propositional satisfiability
• 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 complexity of pattern matching for highly compressed two-dimensional texts.
• 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
• Relating weight constraint and aggregate programs: Semantics and representation
• 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
• Weight constraints as nested expressions
• Strong equivalence made easy: nested expressions and weight constraints
• Conflict-driven ASP solving with external sources
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Strongly equivalent logic programs

This page was built for publication: Rewriting recursive aggregates in answer set programming: back to monotonicity