Dear Arnaud,
there is actually quite some documentation available about the
technology used in Oz/Mozart for solving constraint problems.
For constraint propagation, please check Tobias Mueller's thesis:
http://www.mozart-oz.org/papers/abstracts/TobiasMuellerDiss.html
For search, please check my book or thesis:
http://link.springer.de/link/service/series/0558/tocs/t2302.htm
or
http://www.mozart-oz.org/papers/abstracts/ProgrammingConstraintServices.
html
The point is that you can program search in Oz (as will become clear
from reading the search stuff). The most commonly used strategy is
chronlogical backtracking implemented by copying.
Christian
"Arnaud Doniec" <arnaud.doniec@meletu.univ-valenciennes.fr> wrote in
message news:<1035814609.352.33.camel@inspiron>...
> Hello,
>
> Is there some papers which deal about the differents algorithms which
> are used by Oz for solving constraints problems ? For exemple, I would
> like to know if Oz uses backtracking or backjumping (or other...) to
> search solutions.
>
>
> Thanks in advance.
> -
> Please send submissions to hackers@mozart-oz.org
> and administriva mail to hackers-request@mozart-oz.org.
> The Mozart Oz web site is at http://www.mozart-oz.org/.
-
Please send submissions to hackers@mozart-oz.org
and administriva mail to hackers-request@mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.