Reformulation of Global Constraints in Answer Set Programming

We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing the power of global propagators to answer set programming. For example, they provide other constraints with access to the state of the propagator by sharing variables. Such sharing can be used to improve propagation between constraints. Experiments with these encodings demonstrate their promise.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Christian Drescher, Toby Walsh
• Keywords: Answer Set, Answer Set Programs, CORR 2010, Education, Global Constraints