Abstract
Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the complexity of building models for constraint and optimisation problems, we have asked ourselves whether, for modelling purposes, it is really necessary to introduce more new languages and notations. We have analyzed several emerging languages and formal notations and found (to our surprise) that the already existing Z notation, although not previously used in this context, proves to a high degree expressive, adaptable, and useful for the construction of problem models. To substantiate these claims, we have both compiled a large number of constraint and optimisation problems as formal Z specifications and translated models from a variety of constraint languages into Z. The results are available as an online library of model specifications, which we make openly available to the modelling community.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bakewell, A., Frisch, A.M., Miguel, I.: Towards Automatic Modelling of Constraint Satisfaction Problems: A System Based on Compositional Refinement. In: Proceedings of the Reform 2003 workshop, co-located with CP 2003, pp. 2–17 (2003)
Flener, P., Pearson, J., Ågren, M.: Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. In: Proc. Reform 2003, pp. 63–77 (2003)
Gent, I.P., Walsh, T.: CSPLib: A Benchmark Library for Constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480–481. Springer, Heidelberg (1999)
Hentenryck, P.V.: The OPL Optimization Programming Language. MIT, Cambridge (1999)
Hnich, B.: Function Variables for Constraint Programming. PhD thesis, Department of Information Science, Uppsala University, Sweden (2003)
Law, Y.C., Lee, J.H.M.: Algebraic Properties of CSP Model Operators. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 57–71. Springer, Heidelberg (2002)
Renker, G.: A comparison between the F language and the Z notation. Technical report, Constraints Group, Robert Gordon University, Aberdeen (November 2003)
Renker, G., Ahriz, H., Arana, I.: A Synergy of Modelling for Constraint Problems. In: Palade, V., Howlett, R.J., Jain, L. (eds.) KES 2003. LNCS (LNAI), vol. 2773, pp. 1030–1038. Springer, Heidelberg (2003)
Smith, B.: Constraint Programming in Practice: Scheduling a Rehearsal. Technical Report APES-67-2003, APES Research Group (September 2003)
Spivey, J.M.: Understanding Z: A specification language and its formal semantics. Cambridge tracts in theoretical computer science, vol. 3. CUP (1988)
Spivey, J.M.: The Z Notation: A Reference Manual. Oriel College, Oxford (1998)
Walsh, T.: Constraint Patterns. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 53–64. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Renker, G., Ahriz, H. (2004). Building Models through Formal Specification. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive