{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:55:12Z","timestamp":1648994112431},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T00:00:00Z","timestamp":1279756800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10601-010-9099-7","type":"journal-article","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T09:33:03Z","timestamp":1279704783000},"page":"540-573","source":"Crossref","is-referenced-by-count":1,"title":["Interleaving solving and elicitation of constraint satisfaction problems based on expected cost"],"prefix":"10.1007","volume":"15","author":[{"given":"Nic","family":"Wilson","sequence":"first","affiliation":[]},{"given":"Diarmuid","family":"Grimes","sequence":"additional","affiliation":[]},{"given":"Eugene C.","family":"Freuder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,22]]},"reference":[{"key":"9099_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J Amilhastre","year":"2002","unstructured":"Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency restoration and explanations in dynamic CSPs\u2014Application to configuration. Artificial Intelligence, 135, 199\u2013234.","journal-title":"Artificial Intelligence"},{"key":"9099_CR2","unstructured":"Bellman, R. (1957). Dynamic programming. Princeton University Press."},{"issue":"3","key":"9099_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1026441215081","volume":"4","author":"S Bistarelli","year":"1999","unstructured":"Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., & Fargier, H. (1999). Semiring-based CSPs and Valued CSPs: Frameworks, properties and comparison. Constraints, 4(3), 199\u2013240.","journal-title":"Constraints"},{"issue":"4","key":"9099_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22(4), 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"9099_CR5","doi-asserted-by":"crossref","unstructured":"Cucchiara, R., Lamma, E., Mello, P., & Milano, M. (1997). An interactive constraint-based system for selective attention in visual search. In International syposium on methodologies for intelligent systems (pp. 431\u2013440).","DOI":"10.1007\/3-540-63614-5_42"},{"issue":"3","key":"9099_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/ijoc.1.3.181","volume":"1","author":"A Dechter","year":"1989","unstructured":"Dechter, A., & Dechter, R. (1989). On the greedy solution of ordering problems. ORSA Journal on Computing, 1(3), 181\u2013189.","journal-title":"ORSA Journal on Computing"},{"key":"9099_CR7","unstructured":"Dechter, R., & Dechter, A. (1988). Belief maintenance in dynamic constraint networks. In Proceedings of the 7th national conference on artificial intelligence (AAAI-88) (pp. 37\u201342)."},{"key":"9099_CR8","doi-asserted-by":"crossref","unstructured":"Faltings, B., & Macho-Gonzalez, S. (2002). Open constraint satisfaction. In Proceedings of the 8th international conference on principles and practice of constraint programming (CP-2002) (pp. 356\u2013370).","DOI":"10.1007\/3-540-46135-3_24"},{"key":"9099_CR9","doi-asserted-by":"crossref","unstructured":"Faltings, B., & Macho-Gonzalez, S. (2003). Open constraint optimization. In Proceedings of the 9th international conference on principles and practice of constraint programming (CP-2003) (pp. 303\u2013317).","DOI":"10.1007\/978-3-540-45193-8_21"},{"issue":"1\u20132","key":"9099_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.artint.2004.10.005","volume":"161","author":"B Faltings","year":"2005","unstructured":"Faltings, B., & Macho-Gonzalez, S. (2005). Open constraint programming. Artificial Intelligence, 161(1\u20132), 181\u2013208.","journal-title":"Artificial Intelligence"},{"key":"9099_CR11","doi-asserted-by":"crossref","unstructured":"Fargier, H., & Lang, J. (1993). Uncertainty in Constraint Satisfaction Problems: A probabilistic approach. In Proceeedings of the European conference on symbolic and quantitative approaches to reasoning and uncertainty, (ECSQARU-93) (pp. 97\u2013104).","DOI":"10.1007\/BFb0028188"},{"key":"9099_CR12","doi-asserted-by":"crossref","unstructured":"Gelain, M., Pini, M. S., Rossi, F., & Venable, K. B. (2007). Dealing with incomplete preferences in soft constraint problems. In Proceedings of the 13th international conference on principles and practice of constraint programming (CP-2007). LNCS (Vol. 4741, pp. 286\u2013300). Springer.","DOI":"10.1007\/978-3-540-74970-7_22"},{"key":"9099_CR13","doi-asserted-by":"crossref","unstructured":"Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2008). Elicitation strategies for fuzzy constraint problems with missing preferences: Algorithms and experimental studies. In Proceedings of the 14th international conference on principles and practice of constraint programming (CP-2008). LNCS (Vol. 5202, pp. 402\u2013417). Springer.","DOI":"10.1007\/978-3-540-85958-1_27"},{"issue":"3\u20134","key":"9099_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.artint.2009.11.015","volume":"174","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2010). Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies. Artificial Intelligence, 174(3\u20134), 270\u2013294.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9099_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1011454308633","volume":"6","author":"IP Gent","year":"2001","unstructured":"Gent, I. P., MacIntyre, E., Prosser, P., Smith, B. M., & Walsh, T. (2001). Random constraint satisfaction: Flaws and structure. Constraints, 6(4), 345\u2013372.","journal-title":"Constraints"},{"key":"9099_CR16","unstructured":"Howard, R., & Matheson, J. (1984). Influence diagrams. In Readings on the principles and applications of decision analysis (pp. 721\u2013762)."},{"key":"9099_CR17","doi-asserted-by":"crossref","unstructured":"Lallouet, A., & Legtchenko, A. (2005). Consistencies for partially defined constraints. In Proceedings of the international conference on tools with artificial intelligence (ICTAI\u201905).","DOI":"10.1109\/ICTAI.2005.49"},{"key":"9099_CR18","unstructured":"Lamma, E., Mello, P., Milano, M., Cucchiara, R., Gavanelli, M., & Piccardi, M. (1999). Constraint propagation and value acquisition: Why we should do it interactively. In Proceedings of the 16th international joint conference on artificial intelligence (IJCAI-99) (pp. 468\u2013477)."},{"issue":"1\u20132","key":"9099_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J Larrosa","year":"2004","unstructured":"Larrosa, J., & Schiex, T. (2004). Solving weighted CSP by maintaining arc consistency. Artificial Intelligence, 159(1\u20132), 1\u201326.","journal-title":"Artificial Intelligence"},{"key":"9099_CR20","unstructured":"Puterman, M. (1994). Markov decision processes, discrete stochastic dynamic programming. Wiley."},{"issue":"1","key":"9099_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"SA Tarim","year":"2006","unstructured":"Tarim, S.\u00a0A., Manadhar, A., & Walsh, T. (2006). Stochastic constraint programming: A scenario-based approach. Constraints, 11(1), 53\u201380.","journal-title":"Constraints"},{"key":"9099_CR22","doi-asserted-by":"crossref","unstructured":"Wilson, N., Grimes, D., & Freuder, E. (2007). A cost-based model and algorithms for interleaving solving and elicitation of CSPs. In Proceedings of the 13th international conference on principles and practice of constraint programming (CP-2007) (pp. 666\u2013680).","DOI":"10.1007\/978-3-540-74970-7_47"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9099-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-010-9099-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9099-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:15Z","timestamp":1559243655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-010-9099-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,22]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9099"],"URL":"https:\/\/doi.org\/10.1007\/s10601-010-9099-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,22]]}}}