Content deleted Content added
WolreChris (talk | contribs) Added two references |
WolreChris (talk | contribs) m References |
||
Line 2:
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|url=https://www.sciencedirect.com/science/article/pii/074310669390046J|journal=The Journal of Logic Programming|language=en|volume=16|issue=3-4|pages=277–318|doi=10.1016/0743-1066(93)90046-J|issn=0743-1066}}</ref>
==References==
{{Reflist}}
[[Category:Constraint programming]]
| |||