Solving of constraint satisfaction problems using join trees

We provide a new constraint satisfaction system that extends the constraint network to an acyclic one, computes a join tree, and establishes the directional strong k-consistency before any attempt is made to construct a solution; after this, the variables are instantiated without any backtracking. This method is extremely efficient if the constraint network is acyclic and the number of variables per constraint is bounded by a small constant or if a lot of solutions have to be computed.<
>