Hierarchical fulfillment of conditions

from Wikipedia, the free encyclopedia

Under hierarchical condition satisfaction (in English 'hierarchical constraint satisfaction (HCS)') is used in the artificial intelligence a method understood with the aid of which in the first step, one or more special solutions from a large domain (of possible solutions) using initial general conditions or information be narrowed down. In the next and all subsequent steps, the respective result domain is recursively subjected to the same procedure, but the conditions to be fulfilled change from 'general' to always 'special'. The result is solutions that were not 'screened out' in any of the steps used.