The Power of Regular Constraints in CSPs
| dc.contributor.author | Löffler, Sven | |
| dc.contributor.author | Liu, Ke | |
| dc.contributor.author | Hofstedt, Petra | |
| dc.contributor.editor | Eibl, Maximilian | |
| dc.contributor.editor | Gaedke, Martin | |
| dc.date.accessioned | 2017-08-28T23:48:47Z | |
| dc.date.available | 2017-08-28T23:48:47Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | 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. | en |
| dc.identifier.doi | 10.18420/in2017_57 | |
| dc.identifier.isbn | 978-3-88579-669-5 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik, Bonn | |
| dc.relation.ispartof | INFORMATIK 2017 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-275 | |
| dc.subject | CSP | |
| dc.subject | Global Constraints | |
| dc.subject | Regular Constraint | |
| dc.subject | Optimization | |
| dc.subject | Refinement | |
| dc.subject | DFA | |
| dc.title | The Power of Regular Constraints in CSPs | en |
| gi.citation.endPage | 614 | |
| gi.citation.startPage | 603 | |
| gi.conference.date | 25.-29. September 2017 | |
| gi.conference.location | Chemnitz | |
| gi.conference.sessiontitle | MOC 2017 – 9. Workshop zur Deklarativen Modellierung und effizienten Optimierung komplexer Probleme |
Dateien
Originalbündel
1 - 1 von 1