Abstract
Current-generation constraint programming languages are considered by many, especially in industry, to be too low-level, difficult, and large. In order to unleash the proven powers of constraint technology and make it available to a wider range of people, a higher-level, simpler, and smaller modelling notation is needed.
This work is partially supported by grant 221-99-369 of VR, the Swedish Research Council.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flener, P., Pearson, J., Ågren, M. (2003). Introducing esra, a Relational Language for Modelling Combinatorial Problems (Abstract). In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_95
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive