Normalizing cardinality rules using merging and sorting constructions
From MaRDI portal
Publication:2851248
DOI10.1007/978-3-642-40564-8_19zbMATH Open1405.68044OpenAlexW74208780MaRDI QIDQ2851248FDOQ2851248
Authors: Jori Bomanson, Tomi Janhunen 
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
Recommendations
- Improving the normalization of weight rules in answer set programs
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- Cardinality networks: a theoretical and empirical study
- Cardinality Networks and Their Applications
- Encoding cardinality constraints using multiway merge selection networks
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
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)
