Some fundamental properties of local constraint propagation

摘要

In this paper, we give results about termination of local constraint propagation algorithms under possibly infinite variable coverings. The locally consistent (arc consistent) solution of a constraint problem—if such a solution exists—is shown to be unique, and a sufficient condition on propagations is given to find that solution even in the presence of arbitrary infinite variable coverings.