Hi
I have a fundamental question about CLP vs LP.
I played around with Mozarts LPs features and the smooth integration
with CLP stuff.
I appreciate what can be done with it for e.g. parsing (NLP).
In a previous post i have read, that alice does not support this kind of
programming style.
(no equivalent to Mozarts Space.choose)
Which looks totally reasonable to me, considering what gecode does.
My question is now: How should recursively defined problems that could
utilize constraints be tackled with Gecode style CLP?
Parsing is a good example. A syntax is typically defined recursively and
the size of the parse-tree isnt limited.
The examples in the CLP tutorial are all non-recursive.
I would appreciate any pointer that sheds some light on this.
(The less academic and the more practical the better).
I guess it all comes down to add additional variables and constraints to
an existing Space during search, based upon partial results.
That comes natural in Mozart but is beyond my imagination with gecode.
Thx,
Max
_______________________________________________
alice-users mailing list
[email protected]
http://www.ps.uni-sb.de/mailman/listinfo/alice-users
