{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:23:03Z","timestamp":1725492183329},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"},{"type":"electronic","value":"9783540749707"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74970-7_27","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"364-378","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Management of Heuristics for Solving Structured CSPs"],"prefix":"10.1007","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1006303512524","volume":"24","author":"I. Rish","year":"2000","unstructured":"Rish, I., Dechter, R.: Resolution versus Search: Two Strategies for SAT. Journal of Automated Reasoning\u00a024, 225\u2013275 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"27_CR2","unstructured":"Huang, J., Darwiche, A.: A structure-based variable ordering heuristic for SAT. In: Proceedings of IJCAI, pp. 1167\u20131172 (2003)"},{"key":"27_CR3","unstructured":"Li, W., van Beek, P.: Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition. In: Proceedings of ICTAI, pp. 542\u2013548 (2004)"},{"key":"27_CR4","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"},{"issue":"1-2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket Elimination: A Unifying Framework for Reasoning. Artificial Intelligence\u00a0113(1-2), 41\u201385 (1999)","journal-title":"Artificial Intelligence"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(00)00069-2","volume":"126","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Recursive conditioning. Artificial Intelligence\u00a0126, 5\u201341 (2001)","journal-title":"Artificial Intelligence"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM\u00a030, 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"3","key":"27_CR8","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. J. Comput. Syst. Sci.\u00a064(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/978-3-540-45193-8_48","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C. Terrioux","year":"2003","unstructured":"Terrioux, C., J\u00e9gou, P.: Bounded backtracking for the valued constraint satisfaction problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 709\u2013723. Springer, Heidelberg (2003)"},{"key":"27_CR10","unstructured":"de Givry, S., Schiex, T., Verfaillie, G.: Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In: Proceedings of AAAI, pp. 22\u201327 (2006)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Algorithms"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"282","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, 282\u2013343 (2000)","journal-title":"Artificial Intelligence"},{"key":"27_CR13","unstructured":"Cohen, D., Jeavons, P., Gyssens, M.: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. In: Proc. of IJCAI, pp. 72\u201377 (2005)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. of SODA, pp. 289\u2013298 (2006)","DOI":"10.1145\/1109557.1109590"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P. J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence\u00a0146, 43\u201375 (2003)","journal-title":"Artificial Intelligence"},{"key":"27_CR16","unstructured":"J\u00e9gou, P., Terrioux, C.: Decomposition and good recording for solving Max-CSPs. In: Proc. of ECAI, pp. 196\u2013200 (2004)"},{"key":"27_CR17","unstructured":"Marinescu, R., Dechter, R.: Dynamic Orderings for AND\/OR Branch-and-Bound Search in Graphical Models. In: Proc. of ECAI, pp. 138\u2013142 (2006)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. In: Proc. of IJCAI, pp. 112\u2013117 (2007)","DOI":"10.1002\/9780470612309.ch20"},{"key":"27_CR19","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"27_CR20","unstructured":"Sachenbacher, M., Williams, B.C.: Bounded Search and Symbolic Inference for Constraint Optimization. In: Proc. of IJCAI, pp. 286\u2013291 (2005)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T12:12:26Z","timestamp":1708258346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749691","9783540749707"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}