Shared aggregate sets in answer set programming
From MaRDI portal
(Redirected from Publication:4559794)
Abstract: Aggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. This paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. The proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given. (Under consideration for acceptance in TPLP).
Recommendations
Cites work
- \textit{clingcon}: the next generation
- A Constructive semantic characterization of aggregates in answer set programming
- A New Look at BDDs for Pseudo-Boolean Constraints
- Abstract gringo
- Advances in WASP
- Answer set programming based on propositional satisfiability
- Answer set programming modulo acyclicity
- Anytime answer set optimization via unsatisfiable core shrinking
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Complexity and compilation of GZ-aggregates in answer set programming
- Complexity of super-coherence problems in ASP
- Conflict-driven answer set solving: from theory to practice
- Design and implementation of aggregate functions in the DLV system
- Design and results of the Fifth Answer Set Programming Competition
- Dynamic magic sets and super-coherent answer set programs
- Dynamic magic sets for programs with monotone recursive aggregates
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Extending and implementing the stable model semantics
- scientific article; zbMATH DE number 5996835 (Why is no real title available?)
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with abstract constraint atoms: the role of computations
- Logic programs with propositional connectives and aggregates
- Look-back techniques for ASP programs with aggregates
- Magic sets for disjunctive Datalog programs
- New Encodings of Pseudo-Boolean Constraints into CNF
- Normalizing cardinality rules using merging and sorting constructions
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- On the relation among answer set solvers
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Progress in clasp series 3
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Semantics and complexity of recursive aggregates in answer set programming
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Some (in)translatability results for normal logic programs and propositional theories
- The ASP system DLV2
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- The Sixth Answer Set Programming Competition
- Unsatisfiability-based optimization in clasp
- 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
(8)- Recursive rules with aggregation: a simple unified semantics
- On Reductive Semantics of Aggregates in Answer Set Programming
- The External Interface for Extending WASP
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Enhancing magic sets with an application to ontological reasoning
- Inconsistency proofs for ASP: the ASP-DRUPE format
- On the Complexity of Answer Set Programming with Aggregates
- Aggregate semantics for propositional answer set programs
This page was built for publication: Shared aggregate sets in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559794)
