Dashed Strings and the Replace(-all) Constraint
AuthorAmadini, R; Gange, G; Stuckey, PJ
Source TitleLecture Notes in Computer Science
PublisherSpringer International Publishing
AffiliationComputing and Information Systems
Document TypeConference Paper
CitationsAmadini, R., Gange, G. & Stuckey, P. J. (2020). Dashed Strings and the Replace(-all) Constraint. 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings, LNCS, volume 12333, pp.3-20. Springer International Publishing. https://doi.org/10.1007/978-3-030-58475-7_1.
Access StatusOpen Access
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.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References