Content deleted Content added
→Meta-techniques: clarified why the problem is and that the two methods are complementary |
→Constraint maintenance: discard or does not store |
||
Line 44:
In general, learning all inconsistencies in form of constraints and keeping them indefinitedly may exhaust the available memory and increase the cost of checking consistency of partial evaluations. These problems can be solved by either not storing all learned constraints or by occasionally discarding constraints.
''Bounded learning'' only stores constraints if the inconsistent partial evaluation they represent is smaller than a given constrant number. ''Relevance-bounded learning'' discards constraints (or does not store them at all) that are considered not relevant given the current point of the search space; in particular, it discards or does not store all constraints that represent inconsistent partial evaluations that differ from the current partial evaluation on no more than a given fixed number of variables.
==See also==
| |||