Name
Abstract | ||
|---|---|---|
Current-generation constraint programming languages are considered by many, especially in industry, to be too low-level, difficult, and large. We argue that solver-independent, high-level relational constraint modelling leads to a simpler and smaller language, to more concise, intuitive, and analysable models, as well as to more efficient and effective model formulation, maintenance, reformulation, and verification. All this can be achieved without sacrificing the possibility of efficient solving, so that even time-pressed or less competent modellers can be well assisted. Towards this, we propose the ESRA relational constraint modelling language, showcase its elegance on some well-known problems, and outline a compilation philosophy for such languages. |
Year | Venue | Keywords |
|---|---|---|
2003 | Lecture Notes in Computer Science | constraint programming,computer science |
DocType | Volume | ISSN |
Conference | 3018 | 0302-9743 |
Citations | PageRank | References |
32 | 3.65 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Flener | 1 | 533 | 50.28 |
| Justin Pearson | 2 | 237 | 24.28 |
| Magnus Ågren | 3 | 72 | 8.03 |