MiniZinc with Strings
Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D Scott, Peter J Stuckey, Guido Tack, MV Hermenegildo (ed.), P LopezGarcia (ed.)
Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR) | SPRINGER INTERNATIONAL PUBLISHING AG | Published : 2017
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web security. Nevertheless, practically no constraint programming solver natively supports string constraints. We introduce string variables and a suitable set of string constraints as builtin features of the MiniZinc modelling language. Furthermore, we define an interpreter for converting a MiniZinc model with strings into a FlatZinc instance relying only on integer variables. This conversion is obtained via rewrite rules, and does not require any extension of the ..View full abstract
Related Projects (2)
Awarded by Australian Research Council (ARC)
Awarded by Swedish Research Council (VR)
The authors from the University of Melbourne are supported by the Australian Research Council (ARC) through Linkage Project Grant LP140100437. The authors in Sweden are supported by the Swedish Research Council (VR) through Project Grant 2015-04910. Many thanks to Gustav Bjordal for having run the experiments on his local-search backend  for MiniZinc. Many thanks also to all the referees and to the audience of LOPSTR 2016 for their thoughtful feedback.