Dashed Strings and the Replace(-all) Constraint

    Thumbnail
    Download
    Citations
    Scopus
    Altmetric
    1
    Author
    Amadini, R; Gange, G; Stuckey, PJ
    Date
    2020
    Source Title
    Lecture Notes in Computer Science
    Publisher
    Springer International Publishing
    University of Melbourne Author/s
    Amadini, Roberto; Gange, Graeme; Stuckey, Peter
    Affiliation
    Computing and Information Systems
    Metadata
    Show full item record
    Document Type
    Conference Paper
    Citations
    Amadini, 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 Status
    Open Access
    URI
    http://hdl.handle.net/11343/252789
    DOI
    10.1007/978-3-030-58475-7_1
    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.

    Export Reference in RIS Format     

    Collections