Liu, KeLoeffler, SvenHofstedt, PetraEibl, MaximilianGaedke, Martin2017-08-282017-08-282017978-3-88579-669-5Multi-core processors or many-core processors have become the standard configuration for computers nowadays. Yet, the mainstream constraint solvers have not fully utilized these available computation resources due to the intrinsic difficulty on decomposing constraint satisfaction problems (CSPs). This paper reviews the previous research in parallel constraint solving and proposes a new approach for mapping constraint networks on multi-core or many-core processors by means of hypertree decomposition. We give theoretical considerations and our plans for future research.enCSPconstraint networksparallel constraint solvinghypertree decomposition10.18420/in2017_581617-5468