Using Parallel Singleton Arc Consistency to Enhance Constraint Solving

In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we present a new approach using parallel consistencies to enhance the classical solving process. Specifically, we propose an approach where a master process tries to solve a constraint satisfaction problem while using the results of consistency tests done by auxiliary workers so as to avoid some useless branching.