Heuristic search is one of the most successful approaches to classical planning, finding solution paths in large state spaces. A major focus has been the development of domainindependent heuristic functions. One recent method are partial delete relaxation heuristics, improving over the standard delete relaxation heuristic through imposing a set C of conjunctions to be treated as atomic. Practic...

We present neuropsychological evidence demonstrating that the binding of form elements into shapes dissociates from the binding of surface detail to shape. Data are reported from a patient with bilateral parietal lesions, GK, who manifests left-side visual extinction along with many illusory conjunctions when asked to discriminate both surface and form information about stimuli. We show that th...

When presented with a red T and a green O, observers occasionally make conjunction responses and indicate that they saw a green T. These errors have been interpreted as reflecting separable processing stages of feature detection and integration with the illusory conjunctions arising from a failure at the integration stage. Recently, M. Donk (1999) asserted that the phenomenon of illusory conjun...

This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the pairs X,Yk (1≤k≤n) occurring in these conjunctions. The main benefit of this new technique comes from the fact that, for adjusting the bounds of a variable X according to n conjunctions, we do not perform n sweeps in ...