Abstraction and Reformulation in the Generation of Constraint Models

Alan M. Frisch

doi:10.1007/978-3-540-73580-9_2

Abstraction and Reformulation in the Generation of Constraint Models

Alan M. Frisch

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology.

Original language	Undefined/Unknown
Pages	2-3
DOIs	https://doi.org/10.1007/978-3-540-73580-9_2
Publication status	Published - 2007

Access to Document

10.1007/978-3-540-73580-9_2

http://dx.doi.org/10.1007/978-3-540-73580-9_2

Cite this

@conference{6f60e29fa82d471cb24a0bb577a7c29d,

title = "Abstraction and Reformulation in the Generation of Constraint Models",

abstract = "Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology. ",

author = "Frisch, {Alan M.}",

year = "2007",

doi = "10.1007/978-3-540-73580-9_2",

language = "Undefined/Unknown",

pages = "2--3",

}

TY - CONF

T1 - Abstraction and Reformulation in the Generation of Constraint Models

AU - Frisch, Alan M.

PY - 2007

Y1 - 2007

N2 - Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology.

AB - Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology.

U2 - 10.1007/978-3-540-73580-9_2

DO - 10.1007/978-3-540-73580-9_2

M3 - Paper

SP - 2

EP - 3

ER -