Reformulation of Global Constraints in Answer Set Programming

Details Reformulation of Global Constraints in Answer Set Programming Reformulation of Global Constraints in Answer Set Programming

2010-08-30

arxiv.org/abs/1008.5029v1

Computer Science

Logic in Computer Science

Proceedings of AAAI'10 Workshop on Abstraction, Reformulation, and Approximation. AAAI Technical Report, WS-10-08, pages 14-19

Scientific paper

We show that global constraints on finite domains like all-different 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.

Affiliated with

Also associated with

No associations

Rating

Reformulation of Global Constraints in Answer Set Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reformulation of Global Constraints in Answer Set Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reformulation of Global Constraints in Answer Set Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400669