On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers

DOI10.1007/978-3-642-02846-5_23MaRDI QIDQ4649734zbMATH OpenOpenAlexFDO

Authors Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub

Publication date 13 November 2012

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02846-5_23

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A new approach for weighted constraint satisfaction
• Conflict-driven ASP solving with external sources
• Computing Weighted Solutions in Answer Set Programming
• The Weighted Cfg Constraint
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
• Conflict generalisation in ASP: learning correct and effective non-ground constraints
• Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction

Cites work

• Answer set programming based on propositional satisfiability
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Conflict-Driven Answer Set Enumeration
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 5139167 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Theory and Applications of Satisfiability Testing
• Weight constraints as nested expressions

Cited in

(14)

• What is answer set programming to propositional satisfiability
• Conflict-driven answer set solving: from theory to practice
• Improving the normalization of weight rules in answer set programs
• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Shared aggregate sets in answer set programming
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Enhancing magic sets with an application to ontological reasoning
• Exploiting Game Theory for Analysing Justifications
• Embedding justification theory in approximation fixpoint theory
• SAT solving for variants of first-order subsumption
• On the foundations of grounding in answer set programming
• Aggregate semantics for propositional answer set programs
• Constraint answer set programming: integrational and translational (or SMT-based) approaches
• Ordered completion for logic programs with aggregates

Describes a project that uses

Uses Software

• MiniSat
• Pueblo
• Chaff

This page was built for publication: On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649734)