Improving the Normalization of Weight Rules in Answer Set Programs
From MaRDI portal
Publication:2938492
DOI10.1007/978-3-319-11558-0_12zbMATH Open1432.68056OpenAlexW1752491870MaRDI QIDQ2938492FDOQ2938492
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ASSAT: computing answer sets of a logic program by SAT solvers
- Extending and implementing the stable model semantics
- Nested expressions in logic programs
- Weight constraints as nested expressions
- The DLV system for knowledge representation and reasoning
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Answer set programming based on propositional satisfiability
- A linear-time transformation of linear inequalities into conjunctive normal form
- Design and implementation of aggregate functions in the DLV system
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Cardinality networks: a theoretical and empirical study
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
- New Encodings of Pseudo-Boolean Constraints into CNF
- Normalizing Cardinality Rules Using Merging and Sorting Constructions
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Computing Stable Models via Reductions to Difference Logic
- Optimal Base Encodings for Pseudo-Boolean Constraints
- A New Look at BDDs for Pseudo-Boolean Constraints
- Constraint Propagation for First-Order Logic and Inductive Definitions
- Applying Visible Strong Equivalence in Answer-Set Program Transformations
Cited In (14)
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Aspmc: new frontiers of algebraic answer set counting
- The Design of the Sixth Answer Set Programming Competition
- Rewriting optimization statements in answer-set programs
- Paracoherent answer set computation
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
- A multiparametric view on answer set programming
- The Seventh Answer Set Programming Competition: Design and Results
- Solution Enumeration by Optimality in Answer Set Programming
- Optimizing phylogenetic supertrees using answer set programming
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
- 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: Improving the Normalization of Weight Rules in Answer Set Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938492)
