Rewriting recursive aggregates in answer set programming: back to monotonicity
From MaRDI portal
Publication:4592997
Abstract: Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall performance. In particular, aggregates are rewritten into simpler forms known as monotone aggregates. Since the evaluation of normal programs with monotone aggregates is in general on a lower complexity level than the evaluation of normal programs with arbitrary aggregates, any faithful translation function must introduce disjunction in rule heads in some cases. However, no function of this kind is known. The paper closes this gap by introducing a polynomial, faithful, and modular translation for rewriting common aggregation functions into the simpler form accepted by current solvers. A prototype system allows for experimenting with arbitrary recursive aggregates, which are also supported in the recent version 4.5 of the grounder extsc{gringo}, using the methods presented in this paper. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.
Recommendations
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Semantics and complexity of recursive aggregates in answer set programming
- Logics in Artificial Intelligence
- On the Complexity of Answer Set Programming with Aggregates
- On Reductive Semantics of Aggregates in Answer Set Programming
Cites work
- scientific article; zbMATH DE number 5996835 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- A Constructive semantic characterization of aggregates in answer set programming
- Answer set programming based on propositional satisfiability
- Anytime computation of cautious consequences in answer set programming
- Combining answer set programming with description logics for the semantic web
- Conflict-driven ASP solving with external sources
- Conflict-driven answer set solving: from theory to practice
- Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz
- 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 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 complexity of pattern matching for highly compressed two-dimensional texts.
- On the computational cost of disjunctive logic programming: Propositional case
- Properties and applications of programs with monotone and convex constraints
- Relating weight constraint and aggregate programs: semantics and representation
- Semantics and complexity of recursive aggregates in answer set programming
- Some (in)translatability results for normal logic programs and propositional theories
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Vicious circle principle and logic programs with aggregates
- Weight constraints as nested expressions
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(15)- Solution Enumeration by Optimality in Answer Set Programming
- Enhancing magic sets with an application to ontological reasoning
- On Reductive Semantics of Aggregates in Answer Set Programming
- Shared aggregate sets in answer set programming
- Recursive rules with aggregation: a simple unified semantics
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- ASP-Core-2 input language format
- Multi-shot ASP solving with clingo
- Dynamic magic sets for programs with monotone recursive aggregates
- Semantics and complexity of recursive aggregates in answer set programming
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Inlining external sources in answer set programs
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Anytime answer set optimization via unsatisfiable core shrinking
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
This page was built for publication: Rewriting recursive aggregates in answer set programming: back to monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592997)
