Unifying search algorithms for CSP
Narendra Jussien, Alfred Kastler, Olivier Lhomme · 2002
Ginsberg and McAllester [5] have shown that systematic and nonsystematic search algorithms can be quite close. In this paper, we go one step further in the direction of understanding the relationships between systematic and nonsystematic search algorithms by introducing the PLM model. We introduce a generic search algorithm for solving csp, and we show that search algorithms can be decomposed in primitives. A reduced set of primitives is su#cient to express almost all existing search algorithms.