A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one could predict crucial subproblems (the portions of a constraint satisfaction problem likely to cause each other particular difficulty) in advance, search could address them first. This paper postulates several types of crucial subproblems, and shows how local search can be harnessed to identify them before globaldoi:10.1109/ictai.2006.60 dblp:conf/ictai/EpsteinW06 fatcat:fncs2jxpf5bgtkj724jbzsbhlq