Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

DOI10.1017/S1471068422000126OpenAlexW3158896062WikidataQ114116306 ScholiaQ114116306MaRDI QIDQ5038459

Maurice Bruynooghe, Marc Denecker, Linde Vanbesien

Publication date: 30 September 2022

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

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

zbMATH Keywords

answer set programmingaggregatesapproximation fixpoint theory

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Gringo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating operators and semantics for abstract dialectical frameworks
• Semantics and complexity of recursive aggregates in answer set programming
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Logic programs with abstract constraint atoms: the role of computations
• Uniform semantic treatment of default and autoepistemic logics
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Logic programs with propositional connectives and aggregates
• Well-founded and stable semantics of logic programs with aggregates
• A kripke-kleene semantics for logic programs*
• Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
• Stable reasoning
• Abstract gringo
• A logic of nonmonotone inductive definitions
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory