About the use of local consistency in solving CSPs
Assef Chmeiss, Lakhdar Saïs · 2002
Local consistency is often a suitable paradigm for solving constraint satisfaction problems. We show how search algorithms could be improved, thanks to a smart use of two filtering techniques (path consistency and singleton arc consistency). We propose a possible way to get benefits from using a partial form of path consistency (PC) during the search. We show how local treatment based on singleton arc consistency (SAC) can be used to achieve more powerful pruning.