Sciweavers

Share
CORR
2010
Springer

Reformulation of Global Constraints in Answer Set Programming

9 years 25 days ago
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.
Christian Drescher, Toby Walsh
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CORR
Authors Christian Drescher, Toby Walsh
Comments (0)
books