Propagating Regular membership with dashed strings
R Amadini, G Gange, PJ Stuckey, John Hooker (ed.)
Principles and Practice of Constraint Programming | Springer Nature | Published : 2018
Using dashed strings is an approach recently introduced in Constraint Programming (CP) to represent the domain of string variables, when solving combinatorial problems with string constraints. One of the most important string constraints is that of regular membership: regular (x, R) imposes string x to be a member of the regular language defined by automaton R. The regular constraint is useful for specifying complex constraints on fixed length finite sequences, and regularly appears in CP models. Dealing with regular is also desirable in software testing and verification, because regular expressions are often used in modern programming languages for pattern matching. In this paper, we define..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.