{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:08Z","timestamp":1725603428891},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_14","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"160-171","source":"Crossref","is-referenced-by-count":7,"title":["On Guaranteeing Polynomially Bounded Search Tree Size"],"prefix":"10.1007","author":[{"given":"David A.","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Martin C.","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"Martin J.","family":"Green","sequence":"additional","affiliation":[]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. 2nd edition. Technical Report T2010:07, Swedish Institute of Computer Science, SICS, Isafjordsgatan 22, Box 1263, SE-164 29 Kista, Sweden (November 2010)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/SFCS.2002.1181990","volume-title":"Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002","author":"A.A. Bulatov","year":"2002","unstructured":"Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 649\u2013658. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"9-10","key":"14_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.artint.2010.03.002","volume":"174","author":"M.C. Cooper","year":"2010","unstructured":"Cooper, M.C., Jeavons, P.G., Salamon, A.Z.: Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artif. Intell.\u00a0174(9-10), 570\u2013584 (2010)","journal-title":"Artif. Intell."},{"key":"14_CR4","unstructured":"David, P.: Prise en compte de la s\u00e9mantique dans les probl \u2018emes de satisfaction de contraintes: \u00e9tude des contraintes fonctionnelles. PhD thesis, LIRMM, Universit\u00e9 Montpellier II (1994)"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1613\/jair.167","volume":"2","author":"P. David","year":"1995","unstructured":"David, P.: Using pivot consistency to decompose and solve functional csps. J. Artif. Intell. Res. (JAIR)\u00a02, 447\u2013474 (1995)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"14_CR6","first-page":"325","volume-title":"Proceedings of the 12th International Joint Conference on Artificial Intelligence","author":"Y. Deville","year":"1991","unstructured":"Deville, Y., Van Hentenryck, P.: An efficient arc consistency algorithm for a class of csp problems. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 325\u2013330. Morgan Kaufmann Publishers Inc., San Francisco (1991)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11821069_5","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M. Grohe","year":"2006","unstructured":"Grohe, M.: The structure of tractable constraint satisfaction problems. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 58\u201372. Springer, Heidelberg (2006)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/1109557.1109590","volume-title":"SODA","author":"M. Grohe","year":"2006","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: SODA, pp. 289\u2013298. ACM Press, New York (2006)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-61551-2_80","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"P.G. Jeavons","year":"1996","unstructured":"Jeavons, P.G., Cohen, D.A., Gyssens, M.: A test for tractability. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 267\u2013281. Springer, Heidelberg (1996)"},{"key":"14_CR11","first-page":"731","volume-title":"Proceedings of the 11th National Conference on Artificial Intelligence","author":"P. Jegou","year":"1993","unstructured":"Jegou, P.: Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In: Proceedings of the 11th National Conference on Artificial Intelligence, pp. 731\u2013736. AAAI Press, Menlo Park (1993)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-540-85958-1_35","volume-title":"Principles and Practice of Constraint Programming","author":"A.Z. Salamon","year":"2008","unstructured":"Salamon, A.Z., Jeavons, P.G.: Perfect constraints are tractable. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 524\u2013528. Springer, Heidelberg (2008)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/BF01137440","volume":"42","author":"A.F. Sidorenko","year":"1987","unstructured":"Sidorenko, A.F.: Precise values of turan numbers. Mathematical Notes\u00a042, 913\u2013918 (1987), 10.1007\/BF01137440","journal-title":"Mathematical Notes"},{"issue":"1-3","key":"14_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. Autom. Reasoning\u00a035(1-3), 73\u201388 (2005)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR16","first-page":"417","volume":"6","author":"P. Turan","year":"1961","unstructured":"Turan, P.: Research problems. Publ. Hung. Acad. Sci.\u00a06, 417\u2013423 (1961)","journal-title":"Publ. Hung. Acad. Sci."},{"key":"14_CR17","first-page":"1173","volume-title":"IJCAI","author":"R. Williams","year":"2003","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1173\u20131178. Morgan Kaufmann, San Francisco (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T12:49:44Z","timestamp":1554122984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}