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/.