{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:29Z","timestamp":1725533909143},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_9","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"73-79","source":"Crossref","is-referenced-by-count":11,"title":["Backdoors in the Context of Learning"],"prefix":"10.1007","author":[{"given":"Bistra","family":"Dilkina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to combinatorial optimization: Feasibility and optimality. In: CPAIOR (2009)","DOI":"10.1007\/978-3-642-01929-6_6"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74970-7_20","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"B. Dilkina","year":"2007","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 256\u2013270. Springer, Heidelberg (2007)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Backdoors in the context of learning (extended version). Technical report, Cornell University, Computing and Information Science (April 2009), http:\/\/hdl.handle.net\/1813\/12231","DOI":"10.1007\/978-3-642-02777-2_9"},{"key":"9_CR4","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: AAAI, pp. 431\u2013437 (1998)"},{"key":"9_CR5","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: SAT, pp. 283\u2013292 (2000), http:\/\/www.satlib.org"},{"key":"9_CR6","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: AAAI, pp. 1368\u20131373 (2005)"},{"key":"9_CR7","unstructured":"Kullmann, O.: Investigating a general hierarchy of polynomially decidable classes of cnf\u2019s based on short tree-like resolution proofs. In: ECCC, vol.\u00a041 (1999)"},{"issue":"3-4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/B:AMAI.0000012871.08577.0b","volume":"40","author":"O. Kullmann","year":"2004","unstructured":"Kullmann, O.: Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence\u00a040(3-4), 303\u2013352 (2004)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR9","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: IJCAI, pp. 366\u2013371 (1997)"},{"key":"9_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: DAC, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"9_CR11","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and binary clauses. In: SAT, pp. 96\u2013103 (2004)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Paris, L., Ostrowski, R., Siegel, P., Sais, L.: Computing Horn strong backdoor sets thanks to local search. In: ICTAI, pp. 139\u2013143 (2006)","DOI":"10.1109\/ICTAI.2006.43"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: SAT, pp. 294\u2013299 (2007)","DOI":"10.1007\/978-3-540-72788-0_28"},{"key":"9_CR14","unstructured":"Samer, M., Szeider, S.: Backdoor trees. In: AAAI, pp. 363\u2013368 (2008)"},{"issue":"1-3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10817-005-9007-9","volume":"35","author":"S. Szeider","year":"2005","unstructured":"Szeider, S.: Backdoor sets for DLL subsolvers. J. Auto. Reas.\u00a035(1-3), 73\u201388 (2005)","journal-title":"J. Auto. Reas."},{"key":"9_CR16","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: IJCAI, pp. 1173\u20131178 (2003)"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:58:08Z","timestamp":1558393088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}