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, Department of Mathematics and Computer Science, MINT, Programming Languages and Compiler Construction Group, Konrad-Wachsmann-Allee 5, 03044 Cottbus and Germany

Keyword(s): Constraint Programming, CSP, Decomposition, Optimization, CSOP, Regular CSP.

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

Abstract: This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and concatenation of their underlying deterministic finite automatons (DFAs). This, eventually, often allows to significantly speed-up the solution process of the original rCSP.

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.15.6.77

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). A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction 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 435-442. DOI: 10.5220/0007260204350442

@conference{icaart19,
author={Sven Löffler. and Ke Liu. and Petra Hofstedt.},
title={A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2019},
pages={435-442},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007260204350442},
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 - A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems
SN - 978-989-758-350-6
IS - 2184-433X
AU - Löffler, S.
AU - Liu, K.
AU - Hofstedt, P.
PY - 2019
SP - 435
EP - 442
DO - 10.5220/0007260204350442
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