Content deleted Content added
WolreChris (talk | contribs) m References |
m Open access bot: doi added to citation with #oabot. |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 1:
In [[artificial intelligence]] and [[operations research]], '''hierarchical constraint satisfaction (HCS)''' is a method of handling [[constraint satisfaction]] problems where the [[Variable (mathematics)|variables]] have large domains by exploiting their internal structure.<ref name="wiley">{{Cite journal|last=Mackworth|first=Alan K.|last2=Mulder|first2=Jan A.|last3=Havens|first3=William S.|date=1985-01-01|title=Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems
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 set|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 (mathematics)|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.<ref name="sciencedirect">{{Cite journal|date=1993-07-01|title=Hierarchical constraint logic programming
==References==
| |||