Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems
- 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.
Author: | Sven Löffler, Ke LiuORCiD, Petra HofstedtGND |
---|---|
DOI: | https://doi.org/10.5220/0007455907550761 |
ISBN: | 978-989-758-350-6 |
Title of the source (English): | Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019 |
Publisher: | SciTePress |
Editor: | Ana Paula Rocha, Luc Steels, Jaap van den Herik |
Document Type: | Conference publication peer-reviewed |
Language: | English |
Year of publication: | 2019 |
Tag: | Constraint Satisfaction Problems |
First Page: | 755 |
Last Page: | 761 |
Faculty/Chair: | Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Programmiersprachen und Compilerbau |