{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T01:11:39Z","timestamp":1743556299802,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_30","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"453-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning-Sensitive Backdoors with Restarts"],"prefix":"10.1007","author":[{"given":"Edward","family":"Zulkoski","sequence":"first","affiliation":[]},{"given":"Ruben","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Christoph M.","family":"Wintersteiger","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Robere","sequence":"additional","affiliation":[]},{"given":"Jia Hui","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Czarnecki","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1613\/jair.3152","volume":"40","author":"A Atserias","year":"2011","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. 40, 353\u2013373 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P Beame","year":"2004","unstructured":"Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. 22, 319\u2013351 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P Beame","year":"2014","unstructured":"Beame, P., Kautz, H., Sabharwal, A.: Understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. 22, 319\u2013351 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Beame, P., Sabharwal, A.: Non-restarting sat solvers with simple preprocessing can efficiently simulate resolution. In: AAAI Conference on Artificial Intelligence, pp. 2608\u20132615. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9121"},{"key":"30_CR5","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL restart schemes. In: Pragmatics of SAT Workshop (2015)"},{"key":"30_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of satisfiability, vol. 185. IOS Press (2009)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Buss, S.R., Hoffmann, J., Johannsen, J.: Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. arXiv preprint arXiv:0811.1075 (2008)","DOI":"10.2168\/LMCS-4(4:13)2008"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-01929-6_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to combinatorial optimization: feasibility and optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 56\u201370. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_6"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-02777-2_9","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"B Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Backdoors in the context of learning. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 73\u201379. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_9"},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10472-014-9407-9","volume":"70","author":"B Dilkina","year":"2014","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search. Ann. Math. Artif. Intell. 70(4), 399\u2013431 (2014). https:\/\/doi.org\/10.1007\/s10472-014-9407-9","journal-title":"Ann. Math. Artif. Intell."},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-66263-3_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"R Ganian","year":"2017","unstructured":"Ganian, R., Ramanujan, M.S., Szeider, S.: Backdoor treewidth for SAT. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 20\u201337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_2"},{"key":"30_CR12","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A., et al.: Automated whitebox fuzz testing. In: Network and Distributed System Security Symposium, pp. 151\u2013166. Internet Society (2008)"},{"key":"30_CR13","unstructured":"Haim, S., Heule, M.: Towards ultra rapid restarts. arXiv preprint arXiv:1402.4413 (2014)"},{"key":"30_CR14","unstructured":"Hertel, P., Bacchus, F., Pitassi, T., Van Gelder, A.: Clause learning can effectively p-simulate general propositional resolution. In: AAAI Conference on Artificial Intelligence, pp. 283\u2013290. AAAI Press (2008)"},{"key":"30_CR15","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: International Joint Conference on Artificial Intelligence, pp. 2318\u20132323. AAAI Press (2007)"},{"key":"30_CR16","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: AAAI Conference on Artificial Intelligence, pp. 1368\u20131373. AAAI Press (2005)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-21043-3_33","volume-title":"Advances in Artificial Intelligence","author":"Z Li","year":"2011","unstructured":"Li, Z., van Beek, P.: Finding small backdoors in SAT instances. In: Butz, C., Lingras, P. (eds.) AI 2011. LNCS (LNAI), vol. 6657, pp. 269\u2013280. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21043-3_33"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-40970-2_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"JH Liang","year":"2016","unstructured":"Liang, J.H., Ganesh, V., Poupart, P., Czarnecki, K.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 123\u2013140. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_9"},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"30_CR20","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, 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."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-94144-8_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Nadel","year":"2018","unstructured":"Nadel, A., Ryvchin, V.: Chronological backtracking. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 111\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_7"},{"key":"30_CR23","unstructured":"Pipatsrisawat, K., Darwiche, A.: A new clause learning scheme for efficient unsatisfiability proofs. In: AAAI Conference on Artificial Intelligence, pp. 1481\u20131484 (2008)"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-04244-7_51","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"K Pipatsrisawat","year":"2009","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 654\u2013668. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_51"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"175","author":"K Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artif. Intell. 175, 512\u2013525 (2011). https:\/\/doi.org\/10.1016\/j.artint.2010.002","journal-title":"Artif. Intell."},{"key":"30_CR26","unstructured":"Ruan, Y., Kautz, H., Horvitz, E.: The backdoor key: a path to understanding problem hardness. In: AAAI Conference on Artificial Intelligence, pp. 124\u2013130. AAAI Press (2004)"},{"key":"30_CR27","unstructured":"Samer, M., Szeider, S.: Backdoor trees. In: AAAI Conference on Artificial Intelligence, pp. 363\u2013368. AAAI Press (2008)"},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11591191_40","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Gelder","year":"2005","unstructured":"Gelder, A.: Pool resolution and its relation to regular resolution and DPLL with clause learning. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 580\u2013594. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_40"},{"key":"30_CR29","unstructured":"Williams, R., Gomes, C., Selman, B.: On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 222\u2013230. Springer (2003). https:\/\/doi.org\/10.1.1.128.5725"},{"key":"30_CR30","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: Proceedings of the 2001 IEEE\/ACM International Conference on Computer-Aided Design, pp. 279\u2013285. IEEE Press (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:06:11Z","timestamp":1661817971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}