{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:27Z","timestamp":1761611247934},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_31","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"326-340","source":"Crossref","is-referenced-by-count":18,"title":["Instance-Based Selection of Policies for SAT Solvers"],"prefix":"10.1007","author":[{"given":"Mladen","family":"Nikoli\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Mari\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Predrag","family":"Jani\u010di\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A.: PicoSAT Essentials. Journal on Satisfiability, Boolean Modeling, and Computation (2008)","DOI":"10.3233\/SAT190039"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem-Proving Procedures. In: STOC 1971: Proceedings of the Third Annual ACM Symposium on Theory of Computing. ACM Press, New York (1971)","DOI":"10.1145\/800157.805047"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Commun. ACM (1962)","DOI":"10.1145\/368273.368557"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. J. ACM (1960)","DOI":"10.1145\/321033.321034"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Theory and Applications of Satisfiability Testing (2004)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"31_CR6","volume-title":"Handbook of Knowledge Representation","author":"P. Gomes","year":"2007","unstructured":"Gomes, P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability Solvers. In: Handbook of Knowledge Representation, Elsevier, Amsterdam (2007)"},{"key":"31_CR7","volume-title":"FMCAD 2007: Proceedings of the Formal Methods in Computer Aided Design","author":"F. Hutter","year":"2007","unstructured":"Hutter, F., Babic, D., Hoos, H.H., Hu, A.J.: Boosting Verification by Automatic Tuning of Decision Procedures. In: FMCAD 2007: Proceedings of the Formal Methods in Computer Aided Design, IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74621-8_1","volume-title":"Frontiers of Combining Systems","author":"S. Krsti\u0107","year":"2007","unstructured":"Krsti\u0107, S., Goel, A.: Architecting solvers for SAT modulo theories: Nelson-oppen with DPLL. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS, vol.\u00a04720, pp. 1\u201327. Springer, Heidelberg (2007)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Kibria, R.H.: Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers. In: IJCNN (2007)","DOI":"10.1109\/IJCNN.2007.4371054"},{"key":"31_CR10","volume-title":"AAAI","author":"L. Lobjois","year":"1998","unstructured":"Lobjois, L., Lemaitre, M.: Branch and Bound Algorithm Selection by Performance Prediction. In: AAAI, AAAI Press, Menlo Park (1998)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas algorithms. Information Processing Letters (1993)","DOI":"10.1016\/0020-0190(93)90029-9"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Mari\u0107, F.: Formalization and Implementation of SAT Solvers. Journal of Automated Reasoning (submitted, 2008)","DOI":"10.1007\/s10817-009-9127-8"},{"key":"31_CR13","unstructured":"Mari\u0107, F.: Flexible Implementation of SAT solvers. In: SAT 2009, (submitted, 2009)"},{"key":"31_CR14","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 Design Automation Conference, DAC 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). J. of the ACM (2006)","DOI":"10.1145\/1217856.1217859"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-72788-0_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K. Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: A Lightweight Component Caching Scheme for Satisfiability Solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 294\u2013299. Springer, Heidelberg (2007)"},{"key":"31_CR18","volume-title":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence","author":"H. Samulowitz","year":"2007","unstructured":"Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, AAAI Press, Menlo Park (2007)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection. ACM Comput. Surv. (2008)","DOI":"10.1145\/1456650.1456656"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Tomovic, A., Janicic, P., Keselj, V.: n-Gram-Based Classification and Unsupervised Hierarchical Clustering of Genome Sequences. Computer Methods and Programs in Biomedicine (2006)","DOI":"10.1016\/j.cmpb.2005.11.007"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: The Design and Analysis of an Algorithm Portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"},{"key":"31_CR22","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 (2008)","DOI":"10.1613\/jair.2490"},{"key":"31_CR23","unstructured":"Xu, Y., Stern, D., Samulowitz, H.: Learning Adaptation to Solve Constraint Satisfaction Problems. In: LION 3 (2009)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: International Conference on Computer Aided Design (ICCAD) (2001)","DOI":"10.1145\/774572.774637"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T01:25:57Z","timestamp":1589937957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}