Russ Abbott wrote:
The paper says that
shaving
considers the complete constraint set by trying to set variables to values
in their domain. If the assignment fails, then this value can be removed
from the domain, possibly eliminating many inconsistent values before
starting search.
But that sounds a lot like search to me. So why isn't it considered search?
Any help in understanding this would be appreciated.
It can understand why it sounds like search: it is as a partial search :
a depth-limited sub-search with a limit of 1 and a labeling tree (set
variable to value).
It is'nt considered search because search means a complete search up to
when (a/all/the best) solution is found.
HTH,
--
Grégoire
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
