{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T21:27:27Z","timestamp":1783114047665,"version":"3.54.6"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_47","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"811-827","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pushing Data into CP Models Using Graphical Model Learning and Solving"],"prefix":"10.1007","author":[{"given":"C\u00e9line","family":"Brouard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.artint.2016.06.005","volume":"238","author":"D Allouche","year":"2016","unstructured":"Allouche, D., et al.: Tractability-preserving transformations of global cost functions. Artif. Intell. 238, 166\u2013189 (2016)","journal-title":"Artif. Intell."},{"issue":"4","key":"47_CR2","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"issue":"1","key":"47_CR3","first-page":"3846","volume":"18","author":"SH Bach","year":"2017","unstructured":"Bach, S.H., Broecheler, M., Huang, B., Getoor, L.: Hinge-loss markov random fields and probabilistic soft logic. J. Mach. Learn. Res. 18(1), 3846\u20133912 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1093\/biomet\/64.3.616","volume":"64","author":"J Besag","year":"1977","unstructured":"Besag, J.: Efficiency of pseudolikelihood estimation for simple gaussian fields. Biometrika 64, 616\u2013618 (1977)","journal-title":"Biometrika"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-40627-0_15","volume-title":"Principles and Practice of Constraint Programming","author":"C Bessiere","year":"2013","unstructured":"Bessiere, C., Fargier, H., Lecoutre, C.: Global inverse consistency for interactive constraint satisfaction. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 159\u2013174. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_15"},{"key":"47_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.artint.2016.09.001","volume":"241","author":"C Bessiere","year":"2016","unstructured":"Bessiere, C., Fargier, H., Lecoutre, C.: Computing and restoring global inverse consistency in interactive constraint satisfaction. Artif. Intell. 241, 153\u2013169 (2016)","journal-title":"Artif. Intell."},{"key":"47_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.artint.2015.08.001","volume":"244","author":"C Bessiere","year":"2017","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., O\u2019Sullivan, B.: Constraint acquisition. Artif. Intell. 244, 315\u2013342 (2017)","journal-title":"Artif. Intell."},{"key":"47_CR8","volume-title":"Pattern Recognition and Machine Learning. Information Science and Statistics","author":"CM Bishop","year":"2007","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Information Science and Statistics. Springer, New York (2007). http:\/\/www.worldcat.org\/oclc\/71008143"},{"issue":"1","key":"47_CR9","first-page":"1","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends\u00ae Mach. Learn. 3(1), 1\u201322 (2011)","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"47_CR10","first-page":"1","volume":"154","author":"M Cooper","year":"2020","unstructured":"Cooper, M., de Givry, S., Schiex, T.: Graphical models: queries, complexity, algorithms. Leibniz Int. Proc. Inform. 154, 1\u20134 (2020)","journal-title":"Leibniz Int. Proc. Inform."},{"key":"47_CR11","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart predict, then optimize. arXiv preprint arXiv:1710.08005 (2017)"},{"key":"47_CR12","unstructured":"Fargier, H., Gimenez, P., Mengin, J.: Recommendation for product configuration: an experimental evaluation. In: 18th International Configuration Workshop at CP-16, Toulouse, France (2016)"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Fargier, H., Gimenez, P., Mengin, J.: Learning lexicographic preference trees from positive examples. In: Proceedings of AAAI-18, pp. 2959\u20132966. New Orleans, Louisiana (2018)","DOI":"10.1609\/aaai.v32i1.11808"},{"issue":"3","key":"47_CR14","first-page":"318","volume":"26","author":"H Fargier","year":"2020","unstructured":"Fargier, H., Gimenez, P.F., Mengin, J.: Experimental evaluation of three value recommendation methods in interactive configuration. J. Univ. Comput. Sci. 26(3), 318\u2013342 (2020)","journal-title":"J. Univ. Comput. Sci."},{"key":"47_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-04244-7_27","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"A Favier","year":"2009","unstructured":"Favier, A., de Givry, S., J\u00e9gou, P.: Exploiting problem structure for solution counting. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 335\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_27"},{"issue":"2","key":"47_CR16","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s10601-017-9275-0","volume":"23","author":"EC Freuder","year":"2018","unstructured":"Freuder, E.C.: Progress towards the holy grail. Constraints 23(2), 158\u2013171 (2018)","journal-title":"Constraints"},{"key":"47_CR17","unstructured":"Geman, S., Graffigne, C.: Markov random field image models and their applications to computer vision. In: Proceedings of the International Congress of Mathematicians, Berkeley, CA, vol. 1, p. 2 (1986)"},{"issue":"6","key":"47_CR18","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"47_CR19","unstructured":"Had\u017eic, T., Wasowski, A., Andersen, H.R.: Techniques for efficient interactive configuration of distribution networks. In: Proceedings of IJCAI 2007, Hyderabad, India, pp. 100\u2013105 (2007)"},{"key":"47_CR20","volume-title":"Thinking, Fast and Slow","author":"D Kahneman","year":"2011","unstructured":"Kahneman, D.: Thinking, Fast and Slow. Macmillan, New York (2011)"},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"47_CR22","volume-title":"Approximately Hard: The Unique Games Conjecture","author":"E Klarreich","year":"2011","unstructured":"Klarreich, E.: Approximately Hard: The Unique Games Conjecture. Simons Foundation, New York (2011)"},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"Kumar, M., Kolb, S., Teso, S., De Raedt, L.: Learning MAX-SAT from contextual examples for combinatorial optimisation. In: Proceedings of AAAI 2020, NYC, USA (2020)","DOI":"10.1609\/aaai.v34i04.5877"},{"issue":"11","key":"47_CR24","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"47_CR25","unstructured":"Liu, H., Roeder, K., Wasserman, L.: Stability approach to regularization selection (StARS) for high dimensional graphical models. In: Proceedings of Advances in Neural Information Processing Systems (NIPS 2010), vol. 24, pp. 1432\u20131440 (2010)"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Mandi, J., Demirovi\u0107, E., Stuckey, P., Guns, T., et al.: Smart predict-and-optimize for hard combinatorial optimization problems. In: Proceedings of AAAI 2020 (2020)","DOI":"10.1609\/aaai.v34i02.5521"},{"issue":"2","key":"47_CR27","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1080\/10586458.2013.870056","volume":"23","author":"G McGuire","year":"2014","unstructured":"McGuire, G., Tugemann, B., Civario, G.: There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration. Exp. Math. 23(2), 190\u2013217 (2014)","journal-title":"Exp. Math."},{"issue":"4","key":"47_CR28","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","volume":"18","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Heras, F., Liffiton, M., Planes, J., Marques-Silva, J.: Iterative and core-guided MaxSAT solving: a survey and assessment. Constraints 18(4), 478\u2013534 (2013)","journal-title":"Constraints"},{"key":"47_CR29","unstructured":"Palm, R.B., Paquet, U., Winther, O.: Recurrent relational networks. In: Advances in Neural Information Processing Systems, Montr\u00e9al, Canada, pp. 3372\u20133382 (2018)"},{"key":"47_CR30","first-page":"1302","volume":"54","author":"Y Park","year":"2017","unstructured":"Park, Y., Hallac, D., Boyd, S., Leskovec, J.: Learning the network structure of heterogeneous data via pairwise exponential Markov random fields. Proc. Mach. Learn. Res. 54, 1302 (2017)","journal-title":"Proc. Mach. Learn. Res."},{"issue":"3\u20134","key":"47_CR31","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I Pohl","year":"1970","unstructured":"Pohl, I.: Heuristic search viewed as path finding in a graph. Artif. Intell. 1(3\u20134), 193\u2013204 (1970)","journal-title":"Artif. Intell."},{"key":"47_CR32","volume-title":"Handbook of Constraint Programming","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"issue":"8","key":"47_CR33","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"J Schmidhuber","year":"1997","unstructured":"Schmidhuber, J., Hochreiter, S.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"issue":"12","key":"47_CR34","doi-asserted-by":"crossref","first-page":"5980","DOI":"10.1021\/acs.jctc.5b00594","volume":"11","author":"D Simoncini","year":"2015","unstructured":"Simoncini, D., Allouche, D., de Givry, S., Delmas, C., Barbe, S., Schiex, T.: Guaranteed discrete energy optimization on large protein design problems. J. Chem. Theory Comput. 11(12), 5980\u20135989 (2015)","journal-title":"J. Chem. Theory Comput."},{"issue":"11","key":"47_CR35","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"47_CR36","unstructured":"Vuffray, M., Misra, S., Lokhov, A., Chertkov, M.: Interaction screening: efficient and sample-optimal learning of ising models. In: Advances in Neural Information Processing Systems, pp. 2595\u20132603 (2016)"},{"key":"47_CR37","unstructured":"Wang, P., Donti, P.L., Wilder, B., Kolter, J.Z.: SATnet: bridging deep learning and logical reasoning using a differentiable satisfiability solver. In: Proceedings of ICML 2019, Long Beach, California, USA, vol. 97, pp. 6545\u20136554. PMLR (2019)"},{"issue":"5","key":"47_CR38","first-page":"1052","volume":"86","author":"T Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(5), 1052\u20131060 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."}],"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-030-58475-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:53:18Z","timestamp":1668639198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.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":"122","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":"55","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":"45% - 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":"3.13","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":"3.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}