Gelfond-Zhang aggregates as propositional formulas

DOI10.1016/j.artint.2018.10.007zbMath1478.68363OpenAlexW2725233680MaRDI QIDQ5919599

Sebastian Schellhorn, Pedro Cabalar, Jorge Fandinno, Torsten Schaub

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2018.10.007

zbMATH Keywords

answer set programmingaggregates

Mathematics Subject Classification ID

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

Related Items (2)

Recursive rules with aggregation: a simple unified semantics ⋮ The possibilistic Horn non-clausal knowledge bases

Uses Software

• Gringo

Cites Work

• Semantics and complexity of recursive aggregates in answer set programming
• Equilibrium logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Non-monotonic logic. I
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• Vicious Circle Principle and Logic Programs with Aggregates
• Logic programs with propositional connectives and aggregates
• Functional answer set programming
• 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
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
• On equivalence of infinitary formulas under the stable model semantics
• Abstract gringo
• A denotational semantics for equilibrium logic
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs

This page was built for publication: Gelfond-Zhang aggregates as propositional formulas