Flener, Pierre and Pearson, Justin and Ågren, Magnus (2004) Introducing ESRA, a relational language for modelling combinatorial problems. In: Proceedings of LOPSTR'03: Revised Selected Papers, 25-27 August 2003, Uppsala, Sweden.
Full text not available from this repository.
Official URL: http://www.springerlink.com/index/R1CK0MB0KN5W0MRG
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||Springer LNCS: 3018|
|Deposited By:||Magnus Å gren|
|Deposited On:||12 Oct 2009|
|Last Modified:||18 Nov 2009 16:25|
Repository Staff Only: item control page