Logo des Repositoriums
 
Textdokument

The Power of Regular Constraints in CSPs

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Zusatzinformation

Datum

2017

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik, Bonn

Zusammenfassung

This paper discusses the use of the regular membership constraint as a replacement for other (global) constraints. The goal is to replace some or all constraints of a constraint satisfaction problem (CSP) with regular constraints and to combine them into a new regular constraint to remove redundancy and to improve the solution speed of CSPs. By means of a rostering problem as an example it is shown that our approach allows a significant improvement of the solution performance due to a reduction of the size of the search tree.

Beschreibung

Löffler, Sven; Liu, Ke; Hofstedt, Petra (2017): The Power of Regular Constraints in CSPs. INFORMATIK 2017. DOI: 10.18420/in2017_57. Gesellschaft für Informatik, Bonn. PISSN: 1617-5468. ISBN: 978-3-88579-669-5. pp. 603-614. MOC 2017 – 9. Workshop zur Deklarativen Modellierung und effizienten Optimierung komplexer Probleme. Chemnitz. 25.-29. September 2017

Zitierform

Tags