{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:20:57Z","timestamp":1742944857714,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030645823"},{"type":"electronic","value":"9783030645830"}],"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-64583-0_60","type":"book-chapter","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T12:10:48Z","timestamp":1610021448000},"page":"688-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unit Propagation by Means of Coordinate-Wise Minimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1944-6569","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Dlask","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"key":"60_CR1","unstructured":"Bacchus, F., J\u00e4rvisalo, M., Martins, R.: MaxSAT Evaluation 2019: solver and benchmark descriptions (2019). http:\/\/hdl.handle.net\/10138\/306989"},{"issue":"7\u20138","key":"60_CR2","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., 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":"60_CR3","unstructured":"Cooper, M.C., de Givry, S., S\u00e1nchez, M., Schiex, T., Zytnicki, M.: Virtual arc consistency for weighted CSP. In: AAAI, pp. 253\u2013258 (2008)"},{"key":"60_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-030-53552-0_8","volume-title":"Learning and Intelligent Optimization","author":"T Dlask","year":"2020","unstructured":"Dlask, T., Werner, T.: A class of linear programs solvable by coordinate-wise minimization. In: Kotsireas, I.S., Pardalos, P.M. (eds.) LION 2020. LNCS, vol. 12096, pp. 52\u201367. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53552-0_8"},{"key":"60_CR5","unstructured":"Globerson, A., Jaakkola, T.S.: Fixing max-product: convergent message passing algorithms for MAP LP-relaxations. In: Advances in Neural Information Processing Systems, pp. 553\u2013560 (2008)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Kappes, J., Andres, B., et al.: A comparative study of modern inference techniques for discrete energy minimization problems. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1328\u20131335 (2013)","DOI":"10.1109\/CVPR.2013.175"},{"issue":"10","key":"60_CR7","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"60_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/130945648","volume":"44","author":"V Kolmogorov","year":"2015","unstructured":"Kolmogorov, V., Thapper, J., \u017divn\u00fd, S.: The power of linear programming for general-valued CSPs. SIAM J. Comput. 44(1), 1\u201336 (2015)","journal-title":"SIAM J. Comput."},{"key":"60_CR9","unstructured":"Kovalevsky, V., Koval, V.: A diffusion algorithm for decreasing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR (1975)"},{"issue":"1","key":"60_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"R Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36(1), 63\u201388 (2000)","journal-title":"J. Algorithms"},{"issue":"2\u20134","key":"60_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/SAT190044","volume":"4","author":"K Pipatsrisawat","year":"2008","unstructured":"Pipatsrisawat, K., Palyan, A., Chavira, M., Choi, A., Darwiche, A.: Solving weighted max-sat problems in a reduced search space: a performance analysis. J. Satisfiab. Boolean Model. Comput. 4(2\u20134), 191\u2013217 (2008)","journal-title":"J. Satisfiab. Boolean Model. Comput."},{"issue":"7","key":"60_CR12","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D., Dlask, T.: Relative interior rule in block-coordinate descent. In: Conference on Computer Vision and Pattern Recognition (2020)","DOI":"10.1109\/CVPR42600.2020.00758"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D.: Relative interior rule in block-coordinate minimization. $${\\rm ArXiv}$$.$${\\rm org}$$ (2019)","DOI":"10.1109\/CVPR42600.2020.00758"},{"issue":"1\u20132","key":"60_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artif. Intell. 164(1\u20132), 47\u201380 (2005)","journal-title":"Artif. Intell."},{"key":"60_CR16","unstructured":"Zhang, H., Stickel, M.E.: An efficient algorithm for unit propagation. In: Proceedings of the 4th International Symposium on Artificial Intelligence and Mathematics, vol. 96 (1996)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64583-0_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T20:36:04Z","timestamp":1619469364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64583-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030645823","9783030645830"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64583-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"19 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2020.icas.xyz\/","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":"in-house system and easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"209","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":"116","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":"56% - 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":"5-6","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":"1-2","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)"}}]}}