Dear David,
The constraint solver is based on computational spaces: constraint
propagation + distribution (branching). Please look at the constraint
programming tutorial and the book "Programming Constraint Services" by
Christian Schulte.
http://books.google.de/books?
hl=en&lr=&id=BYXNltNPDGAC&oi=fnd&pg=PA1&sig=NovZrpLx35zt8r-
hYuVPthlfxus&dq=Programming+Constraint+Services&prev=http://
scholar.google.de/
scholar%3Fq%3DProgramming%2BConstraint%2BServices%26hl%3Den%26lr%3D%26sa
%3DG
This programming model allows the user to program constraint services,
e.g., allows the user to define a search engine.
Best,
Torsten
On 30.10.2006, at 03:42, David López wrote:
Which algorithm occupies mozart - oz, for the problems of type CSP?
Backtracking?
Look-Back?
Forward Checking?
_______________________________________________________________________
__________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
--
Torsten Anders
Sonic Arts Research Centre • Queen's University Belfast
Frankstr. 49 • D-50996 Köln
Tel: +49-221-3980750
http://www.torsten-anders.de
http://strasheela.sourceforge.net
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
