On Reductive Semantics of Aggregates in Answer Set Programming
From MaRDI portal
Recommendations
- Semantics and complexity of recursive aggregates in answer set programming
- A Constructive semantic characterization of aggregates in answer set programming
- On the Complexity of Answer Set Programming with Aggregates
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- scientific article; zbMATH DE number 5996835
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Logics in Artificial Intelligence
- Shared aggregate sets in answer set programming
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Complexity and compilation of GZ-aggregates in answer set programming
Cited in
(15)- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- On elementary loops of logic programs
- Team-building with answer set programming in the Gioia-Tauro seaport
- scientific article; zbMATH DE number 5996835 (Why is no real title available?)
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Program completion in the input language of GRINGO
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Preferred first-order answer set programs
- Stable models of formulas with generalized quantifiers (preliminary report)
- On the Complexity of Answer Set Programming with Aggregates
- Gelfond-Zhang aggregates as propositional formulas
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Aggregate semantics for propositional answer set programs
- Ordered completion for logic programs with aggregates
This page was built for publication: On Reductive Semantics of Aggregates in Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643117)