{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:00:32Z","timestamp":1742943632308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031445040"},{"type":"electronic","value":"9783031445057"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44505-7_19","type":"book-chapter","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:03:41Z","timestamp":1698170621000},"page":"270-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Learning When to\u00a0Decompose Graphical Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7485-5309","authenticated-orcid":false,"given":"Aleksandra","family":"Petrova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8322-0505","authenticated-orcid":false,"given":"Javier","family":"Larrosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"key":"19_CR1","unstructured":"Allen, D., Darwiche, A.: New advances in inference by recursive conditioning. In: Meek, C., Kj\u00e6rulff, U. (eds.) UAI 2003, Acapulco, Mexico, 7\u201310 August 2003, pp. 2\u201310. Morgan Kaufmann (2003)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-319-23219-5_2","volume-title":"Principles and Practice of Constraint Programming","author":"D Allouche","year":"2015","unstructured":"Allouche, D., de Givry, S., Katsirelos, G., Schiex, T., Zytnicki, M.: Anytime hybrid best-first search with tree decomposition for weighted CSP. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 12\u201329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_2"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-21434-9_9","volume-title":"Autonomous Search","author":"A Arbelaez","year":"2011","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Continuous search in constraint programming. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 219\u2013243. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_9"},{"key":"19_CR4","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: ICLR 2017, Toulon, France, 24\u201326 April 2017, Workshop Track Proceedings (2017)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0097-3165(73)90016-2","volume":"14","author":"U Bertel\u00e8","year":"1973","unstructured":"Bertel\u00e8, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theory Ser. A 14(2), 137\u2013148 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-18008-3_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Bonfietti","year":"2015","unstructured":"Bonfietti, A., Lombardi, M., Milano, M.: Embedding decision trees and random forests in constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 74\u201390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_6"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints Int. J. 4(1), 79\u201389 (1999). https:\/\/doi.org\/10.1023\/A:1009812409930","journal-title":"Constraints Int. J."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Moisan, T., Rousseau, L.M., Pr\u00e9mont-Schwarz, I., Cire, A.A.: Combining reinforcement learning and constraint programming for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 3677\u20133687 (2021)","DOI":"10.1609\/aaai.v35i5.16484"},{"key":"19_CR9","unstructured":"Cooper, G.F.: Bayesian belief-network inference using recursive decomposition. Technical report, Knowledge Systems Laboratory, Stanford, CA (1990)"},{"issue":"7\u20138","key":"19_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"MC Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., S\u00e1nchez-Fibla, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174(7\u20138), 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"19_CR11","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. Artif. Intell. 126(1\u20132), 5\u201341 (2001)","journal-title":"Artif. Intell."},{"key":"19_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811357","volume-title":"Modeling and Reasoning with Bayesian Networks","author":"A Darwiche","year":"2009","unstructured":"Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)"},{"issue":"1\u20132","key":"19_CR13","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. Artif. Intell. 113(1\u20132), 41\u201385 (1999)","journal-title":"Artif. Intell."},{"key":"19_CR14","unstructured":"Dechter, R.: Constraint Processing. Elsevier\/Morgan Kaufmann (2003)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Dechter, R.: Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms. Synthesis Lectures on Artificial Intelligence and Machine Learning, 2nd edn. Morgan & Claypool Publishers (2019)","DOI":"10.1007\/978-3-031-01583-0"},{"issue":"2\u20133","key":"19_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2006.11.003","volume":"171","author":"R Dechter","year":"2007","unstructured":"Dechter, R., Mateescu, R.: AND\/OR search spaces for graphical models. Artif. Intell. 171(2\u20133), 73\u2013106 (2007)","journal-title":"Artif. Intell."},{"key":"19_CR17","unstructured":"Erdeniz, S.P., Felfernig, A.: Cluster and learn: cluster-specific heuristics for graph coloring. In: PATAT 2018, pp. 401\u2013404 (2018)"},{"key":"19_CR18","unstructured":"Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: IJCAI 1985, Los Angeles, CA, USA, August 1985, pp. 1076\u20131078 (1985)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-93031-2_18","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"A Galassi","year":"2018","unstructured":"Galassi, A., Lombardi, M., Mello, P., Milano, M.: Model agnostic solution of CSPs via deep learning: a preliminary study. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 254\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_18"},{"key":"19_CR20","unstructured":"Gent, I.P., et al.: Learning when to use lazy learning in constraint solving. In: ECAI 2010, Lisbon, Portugal, 16\u201320 August 2010, Proceedings, vol. 215, pp. 873\u2013878. IOS Press (2010)"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Leone, N., Scarcello, F.: Hypertree decompositions: questions and answers. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI, PODS 2016, San Francisco, CA, USA, 26 June\u201301 July 2016, pp. 57\u201374. ACM (2016)","DOI":"10.1145\/2902251.2902309"},{"key":"19_CR23","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: ECAI 2004, Valencia, Spain, 22\u201327 August 2004, pp. 475\u2013479. IOS Press (2004)"},{"key":"19_CR24","unstructured":"Huang, L., et al.: Branch and bound in mixed integer linear programming problems: a survey of techniques and trends. CoRR abs\/2111.06257 (2021). https:\/\/arxiv.org\/abs\/2111.06257"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10601-016-9245-y","volume":"21","author":"B Hurley","year":"2016","unstructured":"Hurley, B., et al.: Multi-language evaluation of exact solvers in graphical model discrete optimization. Constraints Int. J. 21(3), 413\u2013434 (2016). https:\/\/doi.org\/10.1007\/s10601-016-9245-y","journal-title":"Constraints Int. J."},{"issue":"1","key":"19_CR26","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. Artif. Intell. 146(1), 43\u201375 (2003)","journal-title":"Artif. Intell."},{"key":"19_CR27","unstructured":"J\u00e9gou, P., Terrioux, C.: Decomposition and good recording for solving Max-CSPs. In: ECAI 2004, Spain, 22\u201327 August 2004, pp. 196\u2013200 (2004)"},{"key":"19_CR28","unstructured":"J\u00e9gou, P., Terrioux, C.: Combining restarts, nogoods and decompositions for solving CSPs. In: ECAI 2014, Czech Republic, 18\u201322 August 2014, vol. 263, pp. 465\u2013470 (2014)"},{"issue":"2","key":"19_CR29","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10601-016-9248-8","volume":"22","author":"P J\u00e9gou","year":"2017","unstructured":"J\u00e9gou, P., Terrioux, C.: Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints Int. J. 22(2), 191\u2013229 (2017). https:\/\/doi.org\/10.1007\/s10601-016-9248-8","journal-title":"Constraints Int. J."},{"key":"19_CR30","unstructured":"Bayardo Jr., R.J., Miranker, D.P.: On the space-time trade-off in solving constraint satisfaction problems. In: IJCAI 1995, Qu\u00e9bec, Canada, 20\u201325 August 1995, vol. 2, pp. 558\u2013562 (1995)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-85958-1_32","volume-title":"Principles and Practice of Constraint Programming","author":"M Kitching","year":"2008","unstructured":"Kitching, M., Bacchus, F.: Exploiting decomposition in constraint optimization problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 478\u2013492. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_32"},{"key":"19_CR32","unstructured":"Larrosa, J., Meseguer, P., S\u00e1nchez-Fibla, M.: Pseudo-tree search with soft constraints. In: ECAI 2002, Lyon, France, July 2002, pp. 131\u2013135. IOS Press (2002)"},{"issue":"1\u20132","key":"19_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J Larrosa","year":"2004","unstructured":"Larrosa, J., Schiex, T.: Solving weighted CSP by maintaining arc consistency. Artif. Intell. 159(1\u20132), 1\u201326 (2004)","journal-title":"Artif. Intell."},{"key":"19_CR34","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound for graphical models. In: IJCAI-2005, Edinburgh, Scotland, UK, 30 July\u20135 August 2005, pp. 224\u2013229 (2005)"},{"issue":"3","key":"19_CR35","doi-asserted-by":"publisher","first-page":"211","DOI":"10.3233\/AIC-2012-0531","volume":"25","author":"L Otten","year":"2012","unstructured":"Otten, L., Dechter, R.: Anytime AND\/OR depth-first search for combinatorial optimization. AI Commun. 25(3), 211\u2013227 (2012)","journal-title":"AI Commun."},{"issue":"1","key":"19_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10844-021-00666-5","volume":"58","author":"A Popescu","year":"2022","unstructured":"Popescu, A., et al.: An overview of machine learning techniques in constraint solving. J. Intell. Inf. Syst. 58(1), 91\u2013118 (2022). https:\/\/doi.org\/10.1007\/s10844-021-00666-5","journal-title":"J. Intell. Inf. Syst."},{"issue":"1","key":"19_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR38","unstructured":"S\u00e1nchez-Fibla, M., Allouche, D., de Givry, S., Schiex, T.: Russian doll search with tree decomposition. In: IJCAI 2009, California, USA, 11\u201317 July 2009, pp. 603\u2013608 (2009)"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 2833, pp. 709\u2013723. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_48"},{"key":"19_CR40","unstructured":"Verfaillie, G., Lema\u00eetre, M., Schiex, T.: Russian doll search for solving constraint optimization problems. In: IAAI 1996, Portland, Oregon, USA, 4\u20138 August 1996, pp. 181\u2013187 (1996)"},{"key":"19_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/978-3-319-98334-9_38","volume-title":"Principles and Practice of Constraint Programming","author":"H Xu","year":"2018","unstructured":"Xu, H., Koenig, S., Kumar, T.K.S.: Towards effective deep learning for constraint satisfaction problems. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 588\u2013597. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_38"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44505-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:05:23Z","timestamp":1698170723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44505-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031445040","9783031445057"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44505-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion17.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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - 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 (provided by the conference organizers)"}},{"value":"4.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}