Normalizing cardinality rules using merging and sorting constructions

DOI10.1007/978-3-642-40564-8_19MaRDI QIDQ2851248zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

(13)

• A multiparametric view on answer set programming
• \textsc{lp2normal} -- a normalization tool for extended logic programs
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
• Improving the normalization of weight rules in answer set programs
• Multi-level Algorithm Selection for ASP
• Shared aggregate sets in answer set programming
• 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
• Boosting Answer Set Optimization with Weighted Comparator Networks
• Unsatisfiable core analysis and aggregates for optimum stable model search
• Rewriting optimization statements in answer-set programs
• Design and results of the Fifth Answer Set Programming Competition

Describes a project that uses

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)