Propagating lex, find and replace with dashed strings
R Amadini, G Gange, PJ Stuckey, Willem-Jan van Hoeve
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | Springer International Publishing | Published : 2018
Dashed strings have been recently proposed in Constraint Programming to represent the domain of string variables when solving combinatorial problems over strings. This approach showed promising performance on some classes of string problems, involving constraints like string equality and concatenation. However, there are a number of string constraints for which no propagator has yet been defined. In this paper, we show how to propagate lexicographic ordering (lex), find and replace with dashed strings. All of these are fundamental string operations: lex is the natural total order over strings, while find and replace are frequently used in string manipulation. We show that these propagators, ..View full abstract
Related Projects (2)
Awarded by Australian Research Council (ARC)
This work is supported by the Australian Research Council (ARC) through Linkage Project Grant LP140100437 and Discovery Early Career Researcher Award DE160100568.