Abstract
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we will present a value ordering heuristic that attempts to guide the search towards solutions that are acceptable. More specifically, by considering the weights assigned to values and pairs of values, the heuristic will guide the search towards solutions for which the total weight is within an acceptable interval.
This material is based on work supported by Oracle Corporation and by the National Science Foundation under Grant No. IRI-9504316.
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.
References
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based csps and valued csps: Basic properties and comparison. In: Jampel, M., Freuder, E., Maher, M. (eds.) CP-WS 1995. LNCS, vol. 1106, Springer, Heidelberg (1996)
Freuder, E., Wallace, R.: Suggestion strategies for constraint-based matchmaker agents. In: Constraints and Agents, Papers from the 1997 AAAI Workshop, AAAI Press, Menlo Park (1997)
Harvey, W., Ginsberg, M.: Limited discrepany search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, Canada (August 1995)
Hulubei, T., Freuder, E.: The goldilocks problem. In: Configuration, Papers from the 1999 AAAI Workshop, Florida, USA. AAAI Press, Menlo Park (1999)
Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfation. In: 11th European Conference on Artificial Intelligence, Amsterdam. The Netherlands. John Wiley & Sons LTD., Chichester (1994)
von Winterfeldt, D., Edwards, W.: Decision Analysis and Behavioral Research, ch. 8, pp. 259–313. Cambridge University Press, Cambridge (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hulubei, T., Freuder, E.C. (1999). The Goldilocks Problem. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive