Hierarchical constraint satisfaction

Under hierarchical constraint satisfaction ( in English ' hierarchical constraint satisfaction (HCS ) ') means a method in artificial intelligence, by means of which in the first step one or more specific solutions from a large domain ( possible solutions ) with initial conditions of general application or information be limited. In the next and all subsequent steps, the respective result domain is recursively subjected to the same process, but the conditions to be met by ' general ' switch to more ' special '. The results are solutions that have been " screened out " in any of the steps applied.

• Artificial intelligence