Wojciech Kaczmarek wrote:
What I have in mind is to mimic it by tinkering with computational
space. Failing the space is possible. Branching is done at high-
level in gecode lib. I was wondering if there is a low-level api
for creating a child space and manually decide what constraints are
to be added there. Just something like Space.choose in Oz.
The advantage of Space.choose is that it is compatible with the
Space.status method, i.e., it works out-of-the-box with existing
search engines. Something like that cannot be done in Alice/Gecode,
because it would require installing a branching in the Gecode space
that is then called back from the status function.
What you can do, however, is to implement your own search engine.
That would allow you to post arbitrary constraints, also based on the
current state of the space. You can look at the source code of the
Alice search engines, which is in lib/gecode/Search.aml, to get an
idea for the implementation.
Cheers,
Guido
--
Guido Tack
Programming Systems Lab, Saarland University, Germany
http://www.ps.uni-sb.de/~tack
_______________________________________________
alice-users mailing list
[email protected]
http://www.ps.uni-sb.de/mailman/listinfo/alice-users
