Abstract
It could be argued that the widespread use of constraint programming (CP) tools is not being hampered so much by the efficiency of the tools, as much as it is by the limited number of experts available to install and configure such systems. It remains a ‘black-art’ as to what combination of techniques will result in a system which is not only able to solve the problem, but does so in a manner which is appropriate for the application. To this end, we attempt to tackle this problem by creating a system that takes a basic problem description and considers the objectives of an application to create a self-configured system. Further, in the event that system performance starts to decline, we will revisit the original configuration and the system will self-tune to deal with changes in the use of the application.
This work has received support from Science Foundation Ireland under Grant 00/PI.1/C075.
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
Carchrae, T. (2003). Self Configuring Constraint Programming Systems. 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_93
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive