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

Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based characterization of answer sets in terms of nogoods. This provides the semantic underpinnings of our approach in fixing all necessary inferences that must be supported by an appropriate implementation. We then provide key algorithms detailing the salient features needed for implementing weight constraint rules. This involves a sophisticated unfounded set checker as well as an extended propagation algorithm along with the underlying data structures. We implemented our techniques within the ASP solver clasp and demonstrate their effectiveness by an experimental evaluation.

• Type: Conference
• Year: 2009
• Where: ICLP
• Authors: Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
• Keywords: ASP Solver Clasp, ICLP 2009, Programming Languages, Sophisticated Unfounded Set, Weight Constraint Rules