{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:59Z","timestamp":1725558959165},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251767"},{"type":"electronic","value":"9783540322528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11402763_9","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T15:15:23Z","timestamp":1129907723000},"page":"113-127","source":"Crossref","is-referenced-by-count":1,"title":["New Structural Decomposition Techniques for Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Yaling","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree Clustering for Constraint Networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence\u00a066, 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1090\/conm\/178\/01899","volume":"178","author":"P.G. Jeavons","year":"1994","unstructured":"Jeavons, P.G., Cohen, D.A., Gyssens, M.: A Structural Decomposition for Hypergraphs. Contemporary Mathematics\u00a0178, 161\u2013177 (1994)","journal-title":"Contemporary Mathematics"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence\u00a0124, 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E.C. Freuder","year":"1982","unstructured":"Freuder, E.C.: A Sufficient Condition for Backtrack-Free Search. J. ACM\u00a029(1), 24\u201332 (1982)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E.C. Freuder","year":"1985","unstructured":"Freuder, E.C.: A Sufficient Condition for Backtrack-Bounded Search. J. ACM\u00a032(4), 755\u2013761 (1985)","journal-title":"J. ACM"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree Decompositions and Tractable Queries. Journal of Computer and System Sciences\u00a064, 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Harvey, P., Ghose, A.: Reducing Redundancy in the Hypertree Decomposition Scheme. In: The 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), pp. 474\u2013481 (2003)","DOI":"10.1109\/TAI.2003.1250227"},{"key":"9_CR9","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48309-8_1","volume-title":"Database and Expert Systems Applications","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: On Tractable Queries and Constraints. In: Bench-Capon, T.J.M., Soda, G., Tjoa, A.M. (eds.) DEXA 1999. LNCS, vol.\u00a01677, pp. 1\u201315. Springer, Heidelberg (1999)"},{"key":"9_CR11","unstructured":"Gottlob, G., Hutle, M., Wotawa, F.: Combining Hypertree, Bicomp, And Hinge Decomposition. In: Proc. of the 15th ECAI, Lyon, France, pp. 161\u2013165 (2002)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11402763_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:44Z","timestamp":1619506904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11402763_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251767","9783540322528"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11402763_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}