Solving XCSP problems by using Gecode
Published in arXiv (Cornell University) • Dec 28, 2011
NobleIDNI9P61W75R70S87
Authors:,,
Massimo Morara
Jacopo Mauro
Maurizio Gabbrielli
Abstract
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 X...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!