{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:14:34Z","timestamp":1743081274458,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_53","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"618-623","source":"Crossref","is-referenced-by-count":5,"title":["A New Empirical Study of Weak Backdoors"],"prefix":"10.1007","author":[{"given":"Peter","family":"Gregory","sequence":"first","affiliation":[]},{"given":"Maria","family":"Fox","sequence":"additional","affiliation":[]},{"given":"Derek","family":"Long","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Kilby, P., Slaney, J., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings of AAAI 2005 (2005)"},{"key":"53_CR2","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: IJCAI 2003 (2003)"},{"issue":"3","key":"53_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1240","volume":"20","author":"D. Long","year":"2003","unstructured":"Long, D., Fox, M.: The 3rd IPC: Results and analysis. JAIR\u00a020, 1\u201359 (2003)","journal-title":"JAIR"},{"issue":"3","key":"53_CR5","first-page":"47","volume":"22","author":"F. Bacchus","year":"2001","unstructured":"Bacchus, F.: The AIPS 2000 Planning Competition. AI Magazine\u00a022(3), 47\u201356 (2001)","journal-title":"AI Magazine"},{"key":"53_CR6","unstructured":"Kautz, H.A., Selman, B.: Unifying SAT-based and graph-based planning. In: IJCAI, pp. 318\u2013332 (1999)"},{"key":"53_CR7","first-page":"283","volume-title":"SAT2000: Highlights of Satisfiability Research in the year 2000. Frontiers in Artificial Intelligence and Applications","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I., van Maaren, H., Walsh, T. (eds.) SAT2000: Highlights of Satisfiability Research in the year 2000. Frontiers in Artificial Intelligence and Applications, pp. 283\u2013292. Kluwer Academic, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:07:50Z","timestamp":1715238470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}