Abstract
Dashed strings are a formalism for modelling the domain of string variables when solving combinatorial problems with string constraints. In this work we focus on (variants of) the Replace constraint, which aims to find the first occurrence of a query string in a target string, and (possibly) replaces it with a new string. We define a Replace propagator which can also handle Replace-Last (for replacing the last occurrence) and Replace-All (for replacing all the occurrences). Empirical results clearly show that string constraint solving can draw great benefit from this approach.
| Original language | English |
|---|---|
| Title of host publication | Principles and Practice of Constraint Programming |
| Subtitle of host publication | 26th International Conference, CP 2020 Louvain-la-Neuve, Belgium, September 7–11, 2020 Proceedings |
| Editors | Helmut Simonis |
| Place of Publication | Cham Switzerland |
| Publisher | Springer |
| Pages | 3-20 |
| Number of pages | 18 |
| ISBN (Electronic) | 9783030584757 |
| ISBN (Print) | 9783030584740 |
| DOIs | |
| Publication status | Published - 2020 |
| Event | International Conference on Principles and Practice of Constraint Programming 2020 - Louvain-la-Neuve, Belgium Duration: 7 Sept 2020 → 11 Sept 2020 Conference number: 26th https://link.springer.com/book/10.1007/978-3-030-58475-7 (Proceedings) https://cp2020.a4cp.org (Website) |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 12333 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Principles and Practice of Constraint Programming 2020 |
|---|---|
| Abbreviated title | CP2020 |
| Country/Territory | Belgium |
| City | Louvain-la-Neuve |
| Period | 7/09/20 → 11/09/20 |
| Internet address |
|
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver