Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

DOI10.1017/S1471068422000126MaRDI QIDQ5038459zbMATH OpenOpenAlexWikidataFDO

Authors Linde Vanbesien, Maurice Bruynooghe, Marc Denecker

Publication date 30 September 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

aggregatesanswer set programmingapproximation fixpoint theory

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic programs with propositional connectives and aggregates
• On Reductive Semantics of Aggregates in Answer Set Programming
• A Constructive semantic characterization of aggregates in answer set programming
• Semantics and complexity of recursive aggregates in answer set programming

Cites work

• A kripke-kleene semantics for logic programs*
• A logic of nonmonotone inductive definitions
• Abstract gringo
• Answer sets for logic programs with arbitrary abstract constraint atoms
• Approximating operators and semantics for abstract dialectical frameworks
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• scientific article; zbMATH DE number 3648682 (Why is no real title available?)
• scientific article; zbMATH DE number 2085279 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with abstract constraint atoms: the role of computations
• Logic programs with propositional connectives and aggregates
• Semantics and complexity of recursive aggregates in answer set programming
• Stable reasoning
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Uniform semantic treatment of default and autoepistemic logics
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Well-founded and stable semantics of logic programs with aggregates

Cited in

(6)

• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• scientific article; zbMATH DE number 5996835 (Why is no real title available?)
• On Reductive Semantics of Aggregates in Answer Set Programming
• Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
• On the Complexity of Answer Set Programming with Aggregates
• Embedding justification theory in approximation fixpoint theory

Describes a project that uses

Uses Software

• Gringo

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

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