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

DOI10.1007/978-3-642-02846-5_23zbMath1251.68059MaRDI QIDQ4649734

Roland Kaminski, Martin Gebser, Torsten Schaub, Benjamin Kaufmann

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

68N17: Logic programming

Related Items

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, Ordered completion for logic programs with aggregates, 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

Uses Software

• MiniSat
• Pueblo
• Chaff

Cites Work

• Unnamed Item
• Answer set programming based on propositional satisfiability
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Extending and implementing the stable model semantics
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Weight constraints as nested expressions
• Theory and Applications of Satisfiability Testing
• Conflict-Driven Answer Set Enumeration