{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:22:07Z","timestamp":1766067727458,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"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-33271-5_27","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"417-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Virtual Pairwise Consistency in\u00a0Cost Function Networks"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Montalbano","sequence":"first","affiliation":[]},{"given":"David","family":"Allouche","sequence":"additional","affiliation":[]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.artint.2014.03.005","volume":"212","author":"D Allouche","year":"2014","unstructured":"Allouche, D., et al.: Computational protein design as an optimization problem. Artif. Intell. 212, 59\u201379 (2014)","journal-title":"Artif. Intell."},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293\u2013299 (1999)","journal-title":"Constraints"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1002\/prot.26174","volume":"87","author":"F Beuvin","year":"2021","unstructured":"Beuvin, F., de Givry, S., Schiex, T., Verel, S., Simoncini, D.: Iterated local search with partition crossover for computational protein design. Proteins Struct. Funct. Bioinf. 87, 1522\u20131529 (2021)","journal-title":"Proteins Struct. Funct. Bioinf."},{"key":"27_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI. vol. 16, p. 146 (2004)"},{"key":"27_CR5","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.: Radio link frequency assignment. Constraints J. 4, 79\u201389 (1999)","journal-title":"Constraints J."},{"issue":"7\u20138","key":"27_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"M Cooper","year":"2010","unstructured":"Cooper, M., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174(7\u20138), 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10601-005-2240-3","volume":"10","author":"MC Cooper","year":"2005","unstructured":"Cooper, M.C.: High-order consistency in valued constraint satisfaction. Constraints 10, 283\u2013305 (2005)","journal-title":"Constraints"},{"key":"27_CR8","unstructured":"Cooper, M.C., de Givry, S., Schiex, T.: Graphical models: queries, complexity, algorithms (tutorial). In: 37th International Symposium on Theoretical Aspects of Computer Science (STACS-20). LIPIcs, vol. 154, pp. 4:1\u20134:22. Montpellier, France (2020)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-06167-8_7","volume-title":"A Guided Tour of Artificial Intelligence Research","author":"MC Cooper","year":"2020","unstructured":"Cooper, M.C., de Givry, S., Schiex, T.: Valued constraint satisfaction problems. In: Marquis, P., Papini, O., Prade, H. (eds.) A Guided Tour of Artificial Intelligence Research, pp. 185\u2013207. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-06167-8_7"},{"issue":"1\u20132","key":"27_CR10","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."},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/636865.636866","volume":"50","author":"R Dechter","year":"2003","unstructured":"Dechter, R., Rish, I.: Mini-buckets: a general scheme for bounded inference. J. ACM (JACM) 50(2), 107\u2013153 (2003)","journal-title":"J. ACM (JACM)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-98334-9_7","volume-title":"Principles and Practice of Constraint Programming","author":"E Demirovi\u0107","year":"2018","unstructured":"Demirovi\u0107, E., Chu, G., Stuckey, P.J.: Solution-based phase saving for CP: a value-selection heuristic to simulate local search behavior in complete solvers. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 99\u2013108. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_7"},{"key":"27_CR13","unstructured":"Dlask, T., Werner, T., de Givry, S.: Bounds on weighted CSPs using constraint propagation and super-reparametrizations. In: Proceedings of CP-21. Montpellier, France (2021)"},{"key":"27_CR14","unstructured":"Favier, A., de Givry, S., Legarra, A., Schiex, T.: Pairwise decomposition for combinatorial optimization in graphical models. In: Proceedings of IJCAI-11. Barcelona, Spain (2011). http:\/\/www.inra.fr\/mia\/T\/degivry\/Favier11.mov"},{"issue":"3","key":"27_CR15","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 21(3), 413\u2013434 (2016)","journal-title":"Constraints"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Janssen, P., J\u00e9gou, P., Nouguier, B., Vilarem, M.C.: A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. In: IEEE International Workshop on Tools for Artificial Intelligence, pp. 420\u2013421. IEEE Computer Society (1989)","DOI":"10.1109\/TAI.1989.65349"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"JH Kappes","year":"2015","unstructured":"Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Intl. J. of Comput. Vis. 115(2), 155\u2013184 (2015)","journal-title":"Intl. J. of Comput. Vis."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45349-0_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"J Larrosa","year":"2000","unstructured":"Larrosa, J.: Boosting search with variable elimination. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 291\u2013305. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_22"},{"key":"27_CR19","unstructured":"Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proceedings of IJCAI 2005, pp. 193\u2013198. Edinburgh, Scotland (2005)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173, 1592\u20131614 (2009)","journal-title":"Artif. Intell."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Neveu, B., Trombettoni, G., Glover, F.: ID Walk: a candidate list strategy with a simple diversification device. In: Proceedings of CP, pp. 423\u2013437 (2004)","DOI":"10.1007\/978-3-540-30201-8_32"},{"issue":"2","key":"27_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/s10601-016-9250-1","volume":"22","author":"H Nguyen","year":"2017","unstructured":"Nguyen, H., Bessiere, C., de Givry, S., Schiex, T.: Triangle-based consistencies for cost function networks. Constraints 22(2), 230\u2013264 (2017)","journal-title":"Constraints"},{"key":"27_CR23","unstructured":"Otten, L., Ihler, A., Kask, K., Dechter, R.: Winning the pascal 2011 map challenge with enhanced AND\/OR branch-and-bound. In: DISCML 2012 Workshop, at NIPS 2012. Lake Tahoe, NV (2012)"},{"issue":"103194","key":"27_CR24","first-page":"22p","volume":"278","author":"A Quali","year":"2020","unstructured":"Quali, A.: Variable neighborhood search for graphical model energy minimization. Artif. Intell. 278(103194), 22p (2020)","journal-title":"Artif. Intell."},{"key":"27_CR25","unstructured":"Rossi, F., Petrie, C.J., Dhar, V.: On the equivalence of constraint satisfaction problems. In: ECAI, vol. 90, pp. 550\u2013556 (1990)"},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1613\/jair.1776","volume":"24","author":"N Samaras","year":"2005","unstructured":"Samaras, N., Stergiou, K.: Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. J. Artif. Intell. Res. 24, 641\u2013684 (2005)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10601-007-9029-5","volume":"13","author":"M S\u00e1nchez","year":"2008","unstructured":"S\u00e1nchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints 13(1), 130\u2013154 (2008)","journal-title":"Constraints"},{"issue":"3\u20134","key":"27_CR28","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1561\/0600000084","volume":"11","author":"B Savchynskyy","year":"2019","unstructured":"Savchynskyy, B.: Discrete graphical models - an optimization perspective. Found. Trends Comput. Graph. Vis. 11(3\u20134), 160\u2013429 (2019)","journal-title":"Found. Trends Comput. Graph. Vis."},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-98334-9_23","volume-title":"Principles and Practice of Constraint Programming","author":"A Schneider","year":"2018","unstructured":"Schneider, A., Choueiry, B.Y.: PW-AC: extending compact-table to enforce pairwise consistency on table constraints. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 345\u2013361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_23"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Tr\u00f6sser, F., de Givry, S., Katsirelos, G.: Relaxation-aware heuristics for exact optimization in graphical models. In: Proceedings of CP-AI-OR\u20192020, pp. 475\u2013491. Vienna, Austria (2020)","DOI":"10.1007\/978-3-030-58942-4_31"},{"issue":"1\u20132","key":"27_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000001","volume":"1","author":"MJ Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I., et al.: Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn. 1(1\u20132), 1\u2013305 (2008)","journal-title":"Found. Trends Mach. Learn."},{"key":"27_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-030-19212-9_40","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"R Wang","year":"2019","unstructured":"Wang, R., Yap, R.H.C.: Arc consistency revisited. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 599\u2013615. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_40"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Wang, R., Yap, R.H.: Bipartite encoding: a new binary encoding for solving non-binary CSPs. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp. 1184\u20131191 (2021)","DOI":"10.24963\/ijcai.2020\/165"},{"issue":"8","key":"27_CR34","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TPAMI.2009.134","volume":"32","author":"T Werner","year":"2010","unstructured":"Werner, T.: Revisiting the linear programming relaxation approach to Gibbs energy minimization and weighted constraint satisfaction. IEEE Trans. Pattern Anal. Mach. Intell. 32(8), 1474\u20131488 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T21:40:42Z","timestamp":1729460442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_27","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":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","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":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"71","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":"26","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":"6","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":"37% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}