{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:32:06Z","timestamp":1648945926548},"reference-count":13,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T00:00:00Z","timestamp":1060214400000},"content-version":"unspecified","delay-in-days":187,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2003,2]]},"abstract":"<jats:p>Constraint-based reasoning is often used to represent and find \nsolutions to configuration problems. In the field of constraint \nsatisfaction, the major focus has been on finding solutions to \ndifficult problems. However, many real-life configuration problems, \nalthough not extremely complicated, have a huge number of solutions, \nfew of which are acceptable from a practical standpoint. In this paper \nwe present a value ordering heuristic for constraint solving that \nattempts to guide search toward solutions that are acceptable. More \nspecifically, by considering weights that are assigned to values and \nsets of values, the heuristic can guide search toward solutions for \nwhich the total weight is within an acceptable interval. Experiments \nwith random constraint satisfaction problems demonstrate that, when a \nproblem has numerous solutions, the heuristic makes search extremely \nefficient even when there are relatively few solutions that fall within \nthe interval of acceptable weights. In these cases, an algorithm that \nis very effective for finding a feasible solution to a given constraint \nsatisfaction problem (the \u201cmaintained arc consistency\u201d \nalgorithm or MAC) does not find a solution in the same weight interval \nwithin a reasonable time when it is run without the heuristic.<\/jats:p>","DOI":"10.1017\/s0890060403171028","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T15:05:32Z","timestamp":1067007932000},"page":"3-11","source":"Crossref","is-referenced-by-count":5,"title":["The Goldilocks problem"],"prefix":"10.1017","volume":"17","author":[{"given":"TUDOR","family":"HULUBEI","sequence":"first","affiliation":[]},{"given":"EUGENE C.","family":"FREUDER","sequence":"additional","affiliation":[]},{"given":"RICHARD J.","family":"WALLACE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2003,8,7]]},"reference":[{"key":"S0890060403171028_ref011","doi-asserted-by":"crossref","unstructured":"Sabin, D. & Freuder, E. (1994).Contradicting conventional wisdom in constraint satisfaction.Proc. Eleventh Eur. Conf. Artificial Intelligence( Cohn, A. , Ed.), pp.125\u2013129.Chichester, UK:Wiley.","DOI":"10.1007\/3-540-58601-6_86"},{"key":"S0890060403171028_ref009","unstructured":"Mittal, S. & Falkenhainer, B. (1990).Dynamic constraint satisfaction problems.Proc. Eighth National Conf. Artificial Intelligence, pp.25\u201332.Menlo Park, CA:AAAI Press."},{"key":"S0890060403171028_ref008","doi-asserted-by":"crossref","unstructured":"Mackworth, A. (1977).Consistency in networks of relations.Artificial Intelligence 8,99\u2013118.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"S0890060403171028_ref005","unstructured":"Harvey, W. & Ginsberg, M. (1995).Limited discrepancy search.Proc. Fourteenth Int. Joint Conf. Artificial Intelligence, pp.607\u2013613.San Mateo, CA:Morgan Kaufmann."},{"key":"S0890060403171028_ref001","unstructured":"Cheeseman, P. , Kanefsky, B. , & Taylor, W. (1991).Where the really hard problems are.Proc. Twelfth Int. Joint Conf. Artificial Intelligence, pp.331\u2013337.San Mateo, CA:Morgan Kaufmann."},{"key":"S0890060403171028_ref004","doi-asserted-by":"crossref","unstructured":"Freuder, E. & Wallace, R. (2002).Suggestion strategies for constraint-based matchmaker agents.International Journal on Artificial Intelligence Tools 11(1),3\u201318.","DOI":"10.1142\/S0218213002000769"},{"key":"S0890060403171028_ref002","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.84.2.216"},{"key":"S0890060403171028_ref013","doi-asserted-by":"publisher","DOI":"10.1109\/64.585104"},{"key":"S0890060403171028_ref003","doi-asserted-by":"crossref","unstructured":"Felfernig, G. , Friedrich, G. , & Jannach, D. (2001).Conceptual modeling for configuration of mass-customizable products.Artificial Intelligence in Engineering 15(2),165\u2013176.","DOI":"10.1016\/S0954-1810(01)00016-4"},{"key":"S0890060403171028_ref006","doi-asserted-by":"crossref","unstructured":"Hulubei, T. & Freuder, E. (1999).The Goldilocks problem. InPrinciples and Practice of Constraint Programming\u2014CP'99, Lecture Notes in Computer Science, No. 1713( Jaffar, J. , Ed.), pp.234\u2013245.Berlin:Springer.","DOI":"10.1007\/978-3-540-48085-3_17"},{"key":"S0890060403171028_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61479-6"},{"key":"S0890060403171028_ref012","doi-asserted-by":"publisher","DOI":"10.1109\/5254.708432"},{"key":"S0890060403171028_ref010","unstructured":"Mittal, S. & Frayman, F. (1989).Towards a generic model of configuration tasks.Proc. Eleventh Int. Joint Conf. Artificial Intelligence, pp.1395\u20131401.San Mateo, CA:Morgan Kaufmann."}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060403171028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T19:39:34Z","timestamp":1553974774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060403171028\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0890060403171028"],"URL":"https:\/\/doi.org\/10.1017\/s0890060403171028","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}