@conference {IIIA-2001-650, title = {Distributed Dynamic Backtracking}, booktitle = {Proceedings of the IJCAI{\textasciiacute}01. Workshop on Distributed Constraint Reasoning}, year = {2001}, pages = {9-16}, abstract = {In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backtracking. It ensures the completeness of search, and allows a high level of asynchronism by sidestepping the unnecessary addition of links.}, author = {Christian Bessi{\`e}re and Arnold Maestre and Pedro Meseguer}, editor = {Marius-Calin Silaghi} }