loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Sven Löffler ; Ke Liu and Petra Hofstedt

Affiliation: Brandenburg University of Technology Cottbus-Senftenberg, Germany Department of Mathematics and Computer Science, MINT, Berlin, Germany Programming Languages and Compiler Construction Group, Konrad-Wachsmann-Allee 5, 03044 Cottbus and Germany

Keyword(s): Constraint Programming, CSP, CSOP, Decomposition, Parallelization, Optimization, Parallel Constraint Solving, Problem Splitting.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Symbolic Systems

Abstract: 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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.138.125.2

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Löffler, S.; Liu, K. and Hofstedt, P. (2019). Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems. In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-350-6; ISSN 2184-433X, SciTePress, pages 755-761. DOI: 10.5220/0007455907550761

@conference{icaart19,
author={Sven Löffler. and Ke Liu. and Petra Hofstedt.},
title={Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2019},
pages={755-761},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007455907550761},
isbn={978-989-758-350-6},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems
SN - 978-989-758-350-6
IS - 2184-433X
AU - Löffler, S.
AU - Liu, K.
AU - Hofstedt, P.
PY - 2019
SP - 755
EP - 761
DO - 10.5220/0007455907550761
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic