@InProceedings{silaghi01a,
  author =	 {Marius-Calin Silaghi and Djamila Sam-Haroud and
                  Boi Faltings},
  title =	 {Consistency Maintenance for {ABT}},
  booktitle =	 {Proceedings 7th National Conference on Principles
                  and Practicd of Constraint Programming, CP'01,
                  Paphos, Cyprus},
  year =	 2001,
  pages =	 {271--285},
  abstract =	 {One of the most powerful techniques for solving
                  centralized constraint satisfaction problems (CSPs)
                  consists of maintaining local consistency during
                  backtrack search (e.g. [11]). Yet, no work has been
                  reported on such a combination in asynchronous
                  settings1. The difficulty in this case is that, in
                  the usual algorithms, the instantiation and
                  consistency enforcement steps must alternate
                  sequentially. When brought to a distributed setting,
                  a similar approach forces the search algorithm to be
                  synchronous in order to benefit from consistency
                  maintenance. Asynchronism [24, 14] is highly
                  desirable since it increases flexibility and
                  parallelism, and makes the solving process robust
                  against timing variations. One of the most
                  well-known asynchronous search algorithms is
                  Asynchronous Backtracking (ABT). This paper shows
                  how an algorithm for maintaining consistency during
                  distributed asynchronous search can be designed upon
                  ABT. The proposed algorithm is complete and has
                  polynomial-space complexity. Since the consistency
                  propagation is optional, this algorithms generalizes
                  forward checking as well as chronological
                  backtracking. An additional advance over existing
                  centralized algorithms is that it can exploit
                  available backtracking-nogoods for increasing the
                  strength of the maintained consistency. The
                  experimental evaluation shows that it can bring
                  substantial gains in computational power compared
                  with existing asynchronous algorithms.s},
  keywords =     {multiagent dcsp distributed-search},
  googleid =	 {yGcSo-oj624J:scholar.google.com/},
  url =
                  {http://jmvidal.cse.sc.edu/library/silaghi01a.pdf},
  cluster = 	 {7992521454364288968}
}