I have a really tangential question, and I hope it's not too far off
topic. :-/
I've recently run into some constraint problems. For example, I need to
solve systems of linear equations over real numbers, and perhaps
generalize this in various directions. I understand how to propagate
these constraints using well-known algorithms. But I'm looking for a
language which makes this style of programming natural.
Everything I've read suggests that CLP is a promising technique: There's
a whole family of research languages from CLP(R) onward which tackle
constraint problems in elegant ways.
But here's where I get stuck: The most popular constraint languages--Oz,
Alice, GNU Prolog, etc.--focus heavily on finite domains. In some
cases, a real-interval library is available. What I want, though, is
strong propagators: Guassian elimination, the simplex method, and other
tools of that sort. And I don't understand how to make the jump from finite
domains to these tools.
I've read CTM chapter 12 (what a cool book!), and I understand how a
language like CLP(R) fits together. I even see some analogies between
CLP(R)'s deferred constraints and a dataflow model. But I don't know
how to reimplement these tools in Mozart.
So, my questions:
1) Can propagation algorithms such as Guassian elimination be
represented elegantly using Mozart?
2) If so, what papers, books or code do I need to read to get unstuck?
Thank you for any advice you can provide!
Sincerely,
Eric
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
