Content deleted Content added
m robot Adding: de:Hierarchische Bedingungserfüllung |
m Robot - Moving category Constraint satisfaction to Category:Constraint programming per CFD at Wikipedia:Categories for discussion/Log/2011 June 15. |
||
Line 5:
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.
[[Category:Constraint
| |||