{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T18:48:59Z","timestamp":1744138139784},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,23]],"date-time":"2008-07-23T00:00:00Z","timestamp":1216771200000},"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":[[2009,3]]},"DOI":"10.1007\/s10601-008-9052-1","type":"journal-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T07:23:19Z","timestamp":1216711399000},"page":"16-37","source":"Crossref","is-referenced-by-count":6,"title":["Value ordering for quantified CSPs"],"prefix":"10.1007","volume":"14","author":[{"given":"David","family":"Stynes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,23]]},"reference":[{"key":"9052_CR1","first-page":"711","volume-title":"Proceedings of CP, LNCS, LNCS 3258","author":"J. C. Beck","year":"2004","unstructured":"Beck, J.\u00a0C., & Prosser, P.\u00a0R. (2004). Variable ordering heuristics show promise. In Proceedings of CP, LNCS, LNCS 3258 (pp. 711\u2013715). Heidelberg: Springer."},{"key":"9052_CR2","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2006). Reusing CSP propagators for QCSPs. In Proceedings of Workshop on Constraint Solving and Contraint Logic Programming, CSCLP (pp. 63\u201377)."},{"key":"9052_CR3","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2007). QCSP made practical by virtue of restricted quantification. In Proceedings of IJCAI (pp. 38\u201343)."},{"key":"9052_CR4","doi-asserted-by":"crossref","unstructured":"Bessiere, C., & Regin, J.\u00a0C. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP (pp. 61\u201375).","DOI":"10.1007\/3-540-61551-2_66"},{"key":"9052_CR5","unstructured":"Bessiere, C., & Verger, G. (2006). Blocksolve: A bottom-up approach for solving quantified CSPs. In Proceedings of CP (pp. 635\u2013649)."},{"key":"9052_CR6","unstructured":"Bessiere, C., & Verger, G. (2006). Strategic constraint satisfaction problems. In Proceedings of CP workshop on modelling and reformulation (pp. 17\u201329)."},{"key":"9052_CR7","doi-asserted-by":"crossref","unstructured":"Boerner, F., Bulatov, A., Jeavons, P., & Krohkin, A. (2003). Quantified constraints: Algorithms and complexity. In Proceedings of CSL (pp. 244\u2013258).","DOI":"10.1007\/978-3-540-45220-1_6"},{"key":"9052_CR8","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., & Monfroy, E. (2002). Beyond NP: Arc-consistency for quantified constraints. In Proceedings of CP (pp. 371\u2013386).","DOI":"10.1007\/3-540-46135-3_25"},{"key":"9052_CR9","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of ECAI (pp. 146\u2013150)."},{"key":"9052_CR10","unstructured":"Brown, K.\u00a0N., Little, J., Creed, P.\u00a0J., Freuder, E.\u00a0C. (2004), Adversarial constraint satisfaction by game-tree search. In Proceedings of ECAI (pp. 151\u2013155)."},{"issue":"2","key":"9052_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M. (2002). An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28(2), 101\u2013142.","journal-title":"Journal of Automated Reasoning"},{"issue":"4","key":"9052_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10601-006-9002-8","volume":"11","author":"H. Cambazard","year":"2006","unstructured":"Cambazard, H., & Jussien, N. (2006). Identifying and exploiting problem structures using explanation-based constraint programming. Constraints, 11(4), 295\u2013313.","journal-title":"Constraints"},{"key":"9052_CR13","unstructured":"Ferguson, A., & O\u2019Sullivan, B. (2007). Quantified constraint satisfaction: From relaxations to explanations. In Proceedings of IJCAI (pp. 74\u201379)."},{"key":"9052_CR14","unstructured":"Freuder, E.\u00a0C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI (pp. 227\u2013233)."},{"key":"9052_CR15","unstructured":"Frost, D., & Dechter, R. (1995). Look-ahead value ordering for constraint satisfaction problems. In Proceedings of IJCAI (pp. 572\u2013578)."},{"key":"9052_CR16","unstructured":"Geelen, P.\u00a0A. (1992). Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings of ECAI (pp. 31\u201335)."},{"key":"9052_CR17","unstructured":"Gent, I.\u00a0P., Nightingale, P., & Rowley, A. (2004). Encoding quantified CSPs as quantified boolean formulae. In Proceedings of ECAI (pp. 176\u2013180)."},{"key":"9052_CR18","unstructured":"Gent, I.\u00a0P., Nightingale, P., & Stergiou, K. (2005). QCSP-solve: A solver for quantified constraint satisfaction problems. In Proceedings of IJCAI (pp. 138\u2013143)."},{"key":"9052_CR19","unstructured":"Giunchiglia, E., Narizzano, M., & Tacchella, A. (2001). Backjumping for quantified boolean logic satisfiability. In Proceedings of IJCAI (pp. 275\u2013281)."},{"issue":"3","key":"9052_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"Haralick, R.\u00a0M., & Elliott, G.\u00a0L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14(3), 263\u2013313.","journal-title":"Artificial Intelligence"},{"issue":"2\u20133","key":"9052_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10601-006-8061-1","volume":"11","author":"T. Hulubei","year":"2006","unstructured":"Hulubei, T., & O\u2019Sullivan, B. (2006). The impact of search heuristics on heavy-tailed behavior. Constraints Journal, 11(2\u20133), 159\u2013178.","journal-title":"Constraints Journal"},{"key":"9052_CR22","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., & Stergiou, K. (2004). Algorithms for quantified constraint satisfaction problems. In Proceedings of CP (pp. 752\u2013756).","DOI":"10.1007\/978-3-540-30201-8_60"},{"key":"9052_CR23","unstructured":"Nightingale, P. (2007). Consistency and the quantified constraint satisfaction problem. Ph.D. thesis."},{"key":"9052_CR24","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268\u2013299.","journal-title":"Computational Intelligence"},{"key":"9052_CR25","doi-asserted-by":"crossref","unstructured":"Refalo, P. (2004). Impact-based search strategies for constraint programming. In Proceedings of CP (pp. 557\u2013571).","DOI":"10.1007\/978-3-540-30201-8_41"},{"key":"9052_CR26","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E.\u00a0C. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proceedings of second international workshop on principles and practice of constraint programming (PPCP) (Vol. 874, pp. 10\u201320).","DOI":"10.1007\/3-540-58601-6_86"},{"key":"9052_CR27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C. E. Shannon","year":"1950","unstructured":"Shannon, C.\u00a0E. (1950). Programming a computer for playing chess. Philosophical Magazine (Series 7), 41, 256\u2013275.","journal-title":"Philosophical Magazine (Series 7)"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9052-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-008-9052-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9052-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:14Z","timestamp":1559243654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-008-9052-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,23]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9052"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9052-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,23]]}}}