uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
MiniZinc with strings
University of Melbourne, Melbourne, Australia.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Show others and affiliations
2017 (English)In: Logic-Based Program Synthesis and Transformation, Springer, 2017, p. 59-75Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2017. p. 59-75
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 10184
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-309538DOI: 10.1007/978-3-319-63139-4_4ISI: 000441349700004ISBN: 978-3-319-63138-7 (print)ISBN: 978-3-319-63139-4 (electronic)OAI: oai:DiVA.org:uu-309538DiVA, id: diva2:1052018
Conference
26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR), September 6–8, 2016, Edinburgh, Scotland
Funder
Swedish Research Council, 2015-04910Australian Research Council, LP140100437Available from: 2017-07-25 Created: 2016-12-05 Last updated: 2019-02-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Flener, PierrePearson, JustinScott, Joseph D.

Search in DiVA

By author/editor
Flener, PierrePearson, JustinScott, Joseph D.
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 928 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf