A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems

Sven Löffler, Ke Liu, Petra Hofstedt

2019

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.

Paper Citation

in Harvard Style

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, pages 435-442. DOI: 10.5220/0007260204350442

in Bibtex Style

@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},
}

in EndNote Style

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
AU - Löffler S.
AU - Liu K.
AU - Hofstedt P.
PY - 2019
SP - 435
EP - 442
DO - 10.5220/0007260204350442