{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:48:32Z","timestamp":1764557312348,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070452"},{"type":"electronic","value":"9783319070469"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_22","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"301-317","source":"Crossref","is-referenced-by-count":23,"title":["Proteus: A Hierarchical Portfolio of Solvers and Transformations"],"prefix":"10.1007","author":[{"given":"Barry","family":"Hurley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kotthoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Malitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"CSP Solver Competition Benchmarks (2009), \n                    http:\/\/www.cril.univ-artois.fr\/~lecoutre\/benchmarks.html"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11527695_1","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"22_CR3","unstructured":"Audemard, G., Simon, L.: Glucose 2.3 in the SAT 2013 Competition. In: Proceedings of SAT Competition 2013, p. 42 (2013)"},{"key":"22_CR4","unstructured":"Biere, A.: Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013. In: Proceedings of SAT Competition 2013 (2013)"},{"key":"22_CR5","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (February 2009)"},{"key":"22_CR6","unstructured":"Een, N., S\u00f6rensson, N.: Minisat 2.2 (2013), \n                    http:\/\/minisat.se"},{"key":"22_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 260\u2013265. Springer, Heidelberg (2007)"},{"key":"22_CR8","unstructured":"Gecode Team: Gecode: Generic Constraint Development Environment (2006), \n                    http:\/\/www.gecode.org"},{"key":"22_CR9","unstructured":"Gent, I.P.: Arc Consistency in SAT. In: Proceedings of the 15th European Conference on Artificial Intelligence \u2014 ECAI 2002, pp. 121\u2013125 (2002)"},{"key":"22_CR10","unstructured":"Gent, I.P., Kotthoff, L., Miguel, I., Nightingale, P.: Machine learning for constraint solver design \u2013 a case study for the alldifferent constraint. In: 3rd Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 13\u201325 (2010)"},{"issue":"1-2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-02777-2_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"S. Haim","year":"2009","unstructured":"Haim, S., Walsh, T.: Restart strategy selection using machine learning techniques. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 312\u2013325. Springer, Heidelberg (2009)"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: An update. SIGKDD Explor. Newsl.\u00a011(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor. Newsl."},{"key":"22_CR14","unstructured":"Hebrard, E.: Mistral, A Constraint Satisfaction Library. In: Proceedings of the Third International CSP Solver Competition (2008)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-13520-0_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E. Hebrard","year":"2010","unstructured":"Hebrard, E., O\u2019Mahony, E., O\u2019Sullivan, B.: Constraint Programming and Combinatorial Optimisation in Numberjack. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 181\u2013185. Springer, Heidelberg (2010)"},{"issue":"5296","key":"22_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B.A. Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science\u00a0275(5296), 51\u201354 (1997)","journal-title":"Science"},{"key":"22_CR17","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC \u2013 Instance-Specific Algorithm Configuration. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0215, pp. 751\u2013756. IOS Press (2010)"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S.: On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence\u00a045(3), 275\u2013286 (1990), \n                    http:\/\/dx.doi.org\/10.1016\/0004-37029090009-O","journal-title":"Artificial Intelligence"},{"key":"22_CR19","unstructured":"Kotthoff, L.: LLAMA: leveraging learning to automatically manage algorithms. Tech. Rep. arXiv:1306.1031, arXiv (June 2013), \n                    http:\/\/arxiv.org\/abs\/1306.1031"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm Selection for Combinatorial Search Problems: A Survey. AI Magazine (to appear, 2014)","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"22_CR21","unstructured":"Le Berre, D., Lynce, I.: CSP2SAT4J: A Simple CSP to SAT Translator. In: Proceedings of the Second International CSP Solver Competition (2008)"},{"key":"22_CR22","unstructured":"Lecoutre, C., Tabary, S.: Abscon 112, Toward more Robustness. In: Proceedings of the Third International CSP Solver Competition (2008)"},{"key":"22_CR23","unstructured":"Manthey, N.: The SAT Solver RISS3G at SC 2013. In: Proceedings of SAT Competition 2013, p. 72 (2013)"},{"key":"22_CR24","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving. In: Proceeding of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"22_CR26","series-title":"Foundations of Artificial Intelligence","volume-title":"Handbook of Constraint Programming","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier, New York (2006)"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Roussel, O., Lecoutre, C.: XML Representation of Constraint Networks: Format XCSP 2.1. CoRR abs\/0902.2362 (2009)","DOI":"10.1002\/9780470611821"},{"key":"22_CR28","unstructured":"Soos, M.: Cryptominisat 2.9.0 (2011)"},{"key":"22_CR29","unstructured":"Tamura, N., Tanjo, T., Banbara, M.: System Description of a SAT-based CSP Solver Sugar. In: Proceedings of the Third International CSP Solver Competition, pp. 71\u201375 (2009)"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-31612-8_37","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"T. Tanjo","year":"2012","unstructured":"Tanjo, T., Tamura, N., Banbara, M.: Azucar: A SAT-Based CSP Solver Using Compact Order Encoding \u2014 (Tool Presentation). In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 456\u2013462. Springer, Heidelberg (2012)"},{"key":"22_CR31","unstructured":"choco team: choco: An Open Source Java Constraint Programming Library (2008)"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45349-0_32"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-540-74970-7_49","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hierarchical hardness models for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 696\u2013711. Springer, Heidelberg (2007)"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research pp. 565\u2013606 (2008)","DOI":"10.1613\/jair.2490"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:22:05Z","timestamp":1609204925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}