Name
Abstract | ||
|---|---|---|
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 existing FlatZinc specification. This provides a user-friendly interface for modelling combinatorial problems with strings, and enables both string and non-string solvers to actually solve such problems. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-63139-4_4 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 10184 | 0302-9743 |
Citations | PageRank | References |
1 | 0.35 | 29 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Amadini | 1 | 70 | 13.45 |
| Pierre Flener | 2 | 533 | 50.28 |
| Justin Pearson | 3 | 20 | 3.44 |
| Joseph D. Scott | 4 | 1 | 0.35 |
| Peter J. Stuckey | 5 | 4368 | 457.58 |
| Guido Tack | 6 | 377 | 27.56 |