Parameterised Treewidth for Constraint Modelling Languages
Constraint programming is a widely used paradigm to solve combinatorial problems. High-level constraint modelling languages, such as MiniZinc, GAMS, OPL, and AMPL, encourage the separation of instance parameters and models, where the number of variables and constraints depend on values of instance parameters. This paper investigates an extension of treewidth suitable for studying the complexity high-level constraint models.
Authors
- Justin Pearson (ORCID: https://orcid.org/0000-0002-0084-8891)
Institutions
- Uppsala University (SE)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/ictai62512.2024.00015
- Primary Topic
- Constraint Satisfaction and Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Swedish e-Science Research Centre