• search hit 27 of 125
Back to Result List

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

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

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author: Sven Löffler, Ke LiuORCiD, Petra HofstedtGND
DOI:https://doi.org/10.5220/0007260204350442
ISBN:978-989-758-350-6
Title of the source (English):Proceedings of the 11th International Conference on Agents and Artificial Intelligence
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:435
Last Page:442
Faculty/Chair:Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Programmiersprachen und Compilerbau
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.