ASYNCHRONOUS CONSISTENCY MAINTENANCE

Maintaining local consistency during backtrack search is one of the most powerful techniquesfor solving centralized constraint satisfaction problems (CSPs). Yet, no work has been re-ported on such a combination in asynchronous settings. The difficulty in this case is that, in theusual algorithms, the instantiation and consistency enforcement steps must alternate sequen-tially. When brought to a distributed setting, a similar approach forces the search algorithmto be synchronous in order to benefit from consistency maintenance. Asynchronism