Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...