Hierarchical constraint satisfaction: Difference between revisions

Revision as of 10:24, 27 June 2009

Revision as of 11:22, 27 June 2009

Line 1:

{{context}}

{{unreferenced}}

'''Hierarchical Constrain Satisfaction (HCS)''' is a method of handling [[constraint satisfaction]] problems where the variables have large domains by exploiting their internal structure. In fact, for many real world problems the ___domain elements cluster together into sets with common properties and relations. This structure can be represented as a hierarchy and is partially ordered on the subset of a relation. The expectation is that the domains are structured so that the elements of a set frequently share consistency properties permitting them to be retained or eliminated as a unit. Thus, if some elements of a set satisfy a constraint, but not all, the subsets of the set are considered. In this way, if no elements of a set can satisfy the constraint the whole set can be discarded. Thus, structuring the ___domain helps in considering sets of elements all at a time and hence helps in pruning the search space more quickly.

In [[artificial intelligence]] and [[operations research]], '''Hierarchical Constrain Satisfaction (HCS)''' is a method of handling [[constraint satisfaction]] problems where the [[Variable (mathematics)|variables]] have large domains by exploiting their internal structure.

'''Hierarchical Constrain Satisfaction (HCS)''' is a method of handling [[constraint satisfaction]] problems where the variables have large domains by exploiting their internal structure. In fact, forFor many real world problems the ___domain elements cluster together into sets with common properties and relations. This structure can be represented as a hierarchy and is partially ordered on the subset of a relation. The expectation is that the domains are structured so that the elements of a set frequently share consistency properties permitting them to be retained or eliminated as a unit. Thus, if some elements of a set satisfy a [[constraint]], but not all, the subsets of the set are considered. In this way, if no elements of a set can satisfy the constraint the whole set can be discarded. Thus, structuring the ___domain helps in considering sets of elements all at a time and hence helps in pruning the search space more quickly.

[[Category:Constraint satisfaction]]