Complexity and compilation of GZ-aggregates in answer set programming
From MaRDI portal
Publication:4592998
Abstract: Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. The paper focuses on this proposal, and analyzes the complexity of both coherence testing and cautious reasoning under the new semantics. Some surprising results highlight similarities and differences versus mainstream stable model semantics for aggregates. Moreover, the paper reports on the design of compilation techniques for implementing the new semantics on top of existing ASP solvers, which eventually lead to realize a prototype system that allows for experimenting with Gelfond-Zhang's aggregates. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- A Constructive semantic characterization of aggregates in answer set programming
- Anytime computation of cautious consequences in answer set programming
- Combining answer set programming with description logics for the semantic web
- Conflict-driven answer set solving: from theory to practice
- Design and implementation of aggregate functions in the DLV system
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Extending and implementing the stable model semantics
- FLP answer set semantics without circular justifications for general logic programs
- Improving the normalization of weight rules in answer set programs
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with abstract constraint atoms: the role of computations
- Logic programs with propositional connectives and aggregates
- Normalizing cardinality rules using merging and sorting constructions
- On the computational cost of disjunctive logic programming: Propositional case
- Properties and applications of programs with monotone and convex constraints
- Semantics and complexity of recursive aggregates in answer set programming
- Some (in)translatability results for normal logic programs and propositional theories
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Vicious circle principle and logic programs with aggregates
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(12)- Semantics and complexity of recursive aggregates in answer set programming
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- On Reductive Semantics of Aggregates in Answer Set Programming
- Anytime answer set optimization via unsatisfiable core shrinking
- On the Complexity of Answer Set Programming with Aggregates
- Recursive rules with aggregation: a simple unified semantics
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Vicious circle principle and formation of sets in ASP based languages
- Multi-shot ASP solving with clingo
- Gelfond-Zhang aggregates as propositional formulas
- Shared aggregate sets in answer set programming
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
This page was built for publication: Complexity and compilation of GZ-aggregates in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592998)
