The Asynchronous Backtracking Family
Christian Bessière, Ismel Brito ans Arnold Maestre, Pedro Meseguer · 2003
In the last years, the AI community has shown an increasing interest in distributed problem solving. In the scope of distributed constraint reasoning, several asynchronous backtracking procedures have been proposed for finding solutions in a constraint network distributed among several computers. They differ in the way they store failing combinations of values (nogoods), and in the way they check the possible obsolescence of these nogoods. In this paper,