Flener, Pierre and Pearson, Justin and Ågren, Magnus (2003) Introducing ESRA, a relational language for modelling combinatorial problems. In: Proceedings of the 2nd International Workshop on Modelling and Reformulating CSPs, 29 Sept 2003, Kinsdale, County Cork, Ireland.
Full text not available from this repository.
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, and all this without sacrificing the possibility of efficient solving, so that even lazy 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)|
|Deposited By:||Magnus Å gren|
|Deposited On:||12 Oct 2009|
|Last Modified:||18 Nov 2009 16:26|
Repository Staff Only: item control page