On 10/26/05, Raphael Collet <[EMAIL PROTECTED]> wrote:
Russ Abbott wrote:
>> The question is: how can one do
> that in Oz? How can one express range constraints and modifications to
> those range constraints at the Oz level? I imagine it can be done. But
> it will take a bit of work.
Here is how to code that constraint in Oz if Xs is a list of integers:
No dispute. If you can code stuff as integers and use FD, you get more leverage.
> A question that comes to my mind (and that I asked a few messages ago
> but not as fully) is why aren't these features already available at the
> Oz level. Oz must have much of this mechanism already built. Why must
> one write C++ code to get at it?
There are two answers to that question. First, quite a few
combinatorial problems can be easily "coded" with integers or integer
sets. Second, noone has had the time to implement it yet :-(
That was my question. Thanks for the answer.
I would think that since the underlying mechanisms already exist, making them visible at the Oz level wouldn't take that much work--not that I'm volunteering to do it.
Since Oz prides itself as being a platform for exploring issues in programming language design (and not just a language for writing FD constraint programs), exposing the mechanisms that make it possible to reason about range constraints in general would further that vision. I would urge that this be elevated to a higher priority.
-- Russ
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
