Normalizing Cardinality Rules Using Merging and Sorting Constructions

DOI10.1007/978-3-642-40564-8_19zbMATH Open1405.68044OpenAlexW74208780MaRDI QIDQ2851248FDOQ2851248

Tomi Janhunen, Jori Bomanson

Publication date: 10 October 2013

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_19

Mathematics Subject Classification ID

Searching and sorting (68P10) Logic programming (68N17)

Cited In (12)

• Boosting Answer Set Optimization with Weighted Comparator Networks
• Rewriting optimization statements in answer-set programs
• Stable-unstable semantics: Beyond NP with normal logic programs
• Multi-level Algorithm Selection for ASP
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
• A multiparametric view on answer set programming
• Improving the Normalization of Weight Rules in Answer Set Programs
• Design and results of the Fifth Answer Set Programming Competition
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
• Shared aggregate sets in answer set programming
• Complexity and compilation of GZ-aggregates in answer set programming
• Rewriting recursive aggregates in answer set programming: back to monotonicity

Uses Software

• ASSAT

This page was built for publication: Normalizing Cardinality Rules Using Merging and Sorting Constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851248)