Normalizing Cardinality Rules Using Merging and Sorting Constructions

DOI10.1007/978-3-642-40564-8_19zbMath1405.68044OpenAlexW74208780MaRDI QIDQ2851248

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)

Related Items (12)

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

Uses Software

• ASSAT

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