Solving XCSP problems by using Gecode

Details Solving XCSP problems by using Gecode Solving XCSP problems by using Gecode

2011-12-28

arxiv.org/abs/1112.6096v1

Computer Science

Programming Languages

5 pages, http://ceur-ws.org/Vol-810 CILC 2011

Scientific paper

Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permits global constraints and has been the standard format of the international competition of constraint satisfaction problems solvers. In this paper we present a plug-in for solving problems specified in XCSP by exploiting the Gecode solver. This is done by dynamically translating constraints into Gecode library calls, thus avoiding the need to interact with C++.

Affiliated with

Also associated with

No associations

Rating

Solving XCSP problems by using Gecode 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 Solving XCSP problems by using Gecode, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving XCSP problems by using Gecode will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32353