Sciweavers

Share
AAAI
1996

Neighborhood Inverse Consistency Preprocessing

8 years 3 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ective. A new form of consistency preprocessing, neighborhood inverse consistency, can achieve more problem pruning than the usual arc consistency preprocessing in a cost e ective manner. There are two basic ideas: 1) Common forms of consistency enforcement basically operate by identifying and remembering solutions to subproblems for which a consistent value cannot be found for some additional problem variable. The space required for this memory can quickly become prohibitive. Inverse consistency basically operates by removing values for variables that are not consistent with any solution to some subproblem involving additional variables. The space requirement is at worst linear. 2) Typically consistency preprocessing achieves some level of consistency uniformly throughout the problem. A subproblem solution wil...
Eugene C. Freuder, Charles D. Elfe
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where AAAI
Authors Eugene C. Freuder, Charles D. Elfe
Comments (0)
books