Improving the Normalization of Weight Rules in Answer Set Programs

DOI10.1007/978-3-319-11558-0_12zbMath1432.68056OpenAlexW1752491870MaRDI QIDQ2938492

Jori Bomanson, Martin Gebser, Tomi Janhunen

Publication date: 14 January 2015

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (13)

The Design of the Sixth Answer Set Programming Competition ⋮ Shared aggregate sets in answer set programming ⋮ Solution Enumeration by Optimality in Answer Set Programming ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ Optimizing phylogenetic supertrees using answer set programming ⋮ Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination ⋮ Rewriting optimization statements in answer-set programs ⋮ Paracoherent answer set computation ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ 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
• Potassco
• WASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Cardinality networks: a theoretical and empirical study
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Applying Visible Strong Equivalence in Answer-Set Program Transformations
• Constraint Propagation for First-Order Logic and Inductive Definitions
• Optimal Base Encodings for Pseudo-Boolean Constraints
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• A New Look at BDDs for Pseudo-Boolean Constraints
• Design and implementation of aggregate functions in the DLV system
• New Encodings of Pseudo-Boolean Constraints into CNF
• Computing Stable Models via Reductions to Difference Logic
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Weight constraints as nested expressions
• The DLV system for knowledge representation and reasoning
• A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

This page was built for publication: Improving the Normalization of Weight Rules in Answer Set Programs