{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:33:17Z","timestamp":1725471197333},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462910"},{"type":"electronic","value":"9783540462927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11890393_37","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T15:28:19Z","timestamp":1160407699000},"page":"354-363","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving"],"prefix":"10.1007","author":[{"given":"Eric","family":"Monfroy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-30201-8_52","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.C. Beck","year":"2004","unstructured":"Beck, J.C., Prosser, P., Wallace, R.: Variable Ordering Heuristics Show Promise. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 711\u2013715. Springer, Heidelberg (2004)"},{"key":"37_CR2","volume-title":"Proc. of ECAI 1996","author":"J.E. Borrett","year":"1996","unstructured":"Borrett, J.E., Tsang, E.P.K., Walsh, N.R.: Adaptive constraint satisfaction: The quickest first principle. In: Proc. of ECAI 1996. John Wiley and Sons, Chichester (1996)"},{"key":"37_CR3","volume-title":"Computational Logic, Essays in Honor of Alan Robinson","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: Intelligent Backtracking Revisited. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson. MIT Press, Cambridge (1991)"},{"key":"37_CR4","unstructured":"Carchrae, T., Beck, J.C.: Low-Knowledge Algorithm Control. In: Proc. of AAAI 2004, pp. 49\u201354 (2004)"},{"key":"37_CR5","first-page":"369","volume-title":"Proc. of ICLP 1994","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y., Laburthe, F.: Improved clp scheduling with task intervals. In: Proc. of ICLP 1994, pp. 369\u2013383. MIT Press, Cambridge (1994)"},{"key":"37_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11579427_17","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"C. Castro","year":"2005","unstructured":"Castro, C., Monfroy, E., Figueroa, C., Meneses, R.: An approach for dynamic split strategies in constraint solving. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol.\u00a03789, pp. 162\u2013174. Springer, Heidelberg (2005)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-45241-9_19","volume-title":"Practical Aspects of Declarative Languages","author":"P. Flener","year":"2001","unstructured":"Flener, P., Hnich, B., Kiziltan, Z.: A meta-heuristic for subset problems. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, pp. 274\u2013287. Springer, Heidelberg (2001)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-24664-0_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Gebruers","year":"2004","unstructured":"Gebruers, C., Guerri, A., Hnich, B., Milano, M.: Making choices using structure at the instance level within a case based reasoning framework. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 380\u2013386. Springer, Heidelberg (2004)"},{"key":"37_CR9","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proc. of AAAI 1998, Madison, Wisconsin, pp. 431\u2013437 (1998)"},{"key":"37_CR10","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Boosting combinatorial search through randomization. In: Proc. of AAAI 2002, pp. 674\u2013682 (2002)"},{"issue":"1","key":"37_CR11","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for Constraint-Satisfaction Problems: A Survey. A.I. Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"A.I. Magazine"},{"key":"37_CR12","first-page":"99","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in Networks of Relations. AI\u00a08, 99\u2013118 (1977)","journal-title":"AI"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11890393_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:39Z","timestamp":1619508699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11890393_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462910","9783540462927"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11890393_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}