Shared aggregate sets in answer set programming
From MaRDI portal
Publication:4559794
DOI10.1017/S1471068418000133zbMath1451.68062arXiv1804.08488OpenAlexW2963222651MaRDI QIDQ4559794
Marco Maratea, Carmine Dodaro, Mario Alviano
Publication date: 4 December 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.08488
Related Items
Recursive rules with aggregation: a simple unified semantics, Enhancing Magic Sets with an Application to Ontological Reasoning, Inconsistency Proofs for ASP: The ASP - DRUPE Format, The External Interface for Extending WASP, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics and complexity of recursive aggregates in answer set programming
- Answer set programming based on propositional satisfiability
- Design and results of the Fifth Answer Set Programming Competition
- Logic programs with abstract constraint atoms: the role of computations
- On the relation among answer set solvers
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- The ASP system DLV2
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Normalizing Cardinality Rules Using Merging and Sorting Constructions
- Look-back Techniques for ASP Programs with Aggregates
- Vicious Circle Principle and Logic Programs with Aggregates
- Improving the Normalization of Weight Rules in Answer Set Programs
- Logic programs with propositional connectives and aggregates
- Dynamic Magic Sets for Programs with Monotone Recursive Aggregates
- A New Look at BDDs for Pseudo-Boolean Constraints
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Advances in WASP
- Answer Set Programming Modulo Acyclicity
- Progress in clasp Series 3
- Solving SAT and SAT Modulo Theories
- Design and implementation of aggregate functions in the DLV system
- New Encodings of Pseudo-Boolean Constraints into CNF
- Some (in)translatability results for normal logic programs and propositional theories
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Abstract gringo
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Complexity and compilation of GZ-aggregates in answer set programming
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Anytime answer set optimization via unsatisfiable core shrinking
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- Clingcon: The next generation
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Weight constraints as nested expressions
- The Sixth Answer Set Programming Competition
- Unsatisfiability-based optimization in clasp
- Complexity of super-coherence problems in ASP
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming
