{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T23:07:32Z","timestamp":1790723252806,"version":"4.1.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319597751","type":"print"},{"value":"9783319597768","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_13","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T13:26:33Z","timestamp":1496150793000},"page":"167-175","source":"Crossref","is-referenced-by-count":14,"title":["Explanation-Based Weighted Degree"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Hebrard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"13_CR1","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence - ECAI, pp. 146\u2013150 (2004)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-23219-5_10","volume-title":"Principles and Practice of Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Lecoutre, C., Schaus, P.: Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 140\u2013148. Springer, Cham (2015). doi: 10.1007\/978-3-319-23219-5_10"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/978-3-540-74970-7_61","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"D Grimes","year":"2007","unstructured":"Grimes, D., Wallace, R.J.: Sampling strategies and variable selection in weighted degree heuristics. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 831\u2013838. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_61"},{"key":"13_CR4","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. In: Proceedings of the 6th International Joint Conference on Artificial Intelligence - IJCAI, pp. 356\u2013364 (1979)"},{"key":"13_CR5","unstructured":"Hebrard, E.: Mistral, a constraint satisfaction library. In: Proceedings of the CP-08 Third International CSP Solvers Competition, pp. 31\u201340 (2008)"},{"key":"13_CR6","unstructured":"Bayardo Jr., R., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence - AAAI, pp. 203\u2013208 (1997)"},{"issue":"18","key":"13_CR7","doi-asserted-by":"crossref","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"L Christophe","year":"2009","unstructured":"Christophe, L., Sas, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18), 1592\u20131614 (2009)","journal-title":"Artif. Intell."},{"key":"13_CR8","unstructured":"Lopez-Ortiz, A., Quimper, C.G., Tromp, J., Beek, P.V.: A fast and simple algorithm for bounds consistency of the all different constraint. In: Proceedings of the 18th International Joint Conference on AI - IJCAI, pp. 245\u2013250 (2003)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29828-8_15"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference - DAC, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30201-8_41"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. In: ICTAI, pp. 48\u201355 (1993)","DOI":"10.1109\/TAI.1993.633935"},{"key":"13_CR13","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new Search algorithm for satisfiability. In: Proceedings of the IEEE\/ACM International Conference on Computer-aided Design - ICCAD, pp. 220\u2013227 (1996)"},{"issue":"5","key":"13_CR14","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"MJP Silva","year":"1999","unstructured":"Silva, M.J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"13_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1609\/aimag.v35i2.2539","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J.: The minizinc challenge 2008\u20132013. AI Mag. 35(2), 55\u201360 (2014)","journal-title":"AI Mag."},{"issue":"1","key":"13_CR16","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.jalgor.2008.02.009","volume":"63","author":"RJ Wallace","year":"2008","unstructured":"Wallace, R.J., Grimes, D.: Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63(1), 114\u2013129 (2008)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T07:40:02Z","timestamp":1569397202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}