TY - GEN A1 - Löffler, Sven A1 - Liu, Ke A1 - Hofstedt, Petra A2 - Rocha, Ana Paula A2 - Steels, Luc A2 - Herik, Jaap van den T1 - Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems T2 - Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019 N2 - This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original CSP. Therefore, our decomposition approach has two goals: 1. to evenly balance the workload distribution over all cores and solve the partial CSPs as fast as possible and 2. to minimize the number of shared variables to make the join process of the solutions as fast as possible. KW - Constraint Satisfaction Problems Y1 - 2020 UR - https://opus4.kobv.de/opus4-UBICO/frontdoor/index/index/docId/24936 SN - 978-989-758-350-6 SP - 755 EP - 761 PB - SciTePress ER -