{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T02:11:14Z","timestamp":1768097474896,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"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_10","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"160-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Watched Propagation of $$0$$-$$1$$ Integer Linear Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6346-3665","authenticated-orcid":false,"given":"Jo","family":"Devriendt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009, http:\/\/www.zib.de\/Publications\/abstracts\/ZR-05-28\/","DOI":"10.1016\/j.orl.2005.07.009"},{"key":"10_CR2","unstructured":"Bayardo Jr., R.J., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 203\u2013208 (1997)"},{"key":"10_CR3","unstructured":"Bixby, R., Ceria, S., McZeal, C., Savelsbergh, M.: An updated mixed integer programming library: MIPLIB 3.0 (1998)"},{"key":"10_CR4","unstructured":"Blake, A.: Canonical expressions in Boolean algebra. Ph.D. thesis, University of Chicago (1937)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S., Nordstr\u00f6m, J.: Proof complexity and SAT solving. In: Handbook of Satisfiability, 2nd edn. (2020, to appear). Draft version. http:\/\/www.csc.kth.se\/~jakobn\/research\/","DOI":"10.3233\/FAIA200990"},{"key":"10_CR6","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 24(3), 305\u2013317 (2005). Preliminary version in DAC 2003"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC 1971), pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Devriendt, J.: Miplib 0\u20131 instances in OPB format (2020). https:\/\/doi.org\/10.5281\/zenodo.3870965","DOI":"10.5281\/zenodo.3870965"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Devriendt, J.: Online Repository for \u201cWatched Propagation of 0\u20131 Integer Linear Constraints\u201d (2020). https:\/\/doi.org\/10.5281\/zenodo.3952444","DOI":"10.5281\/zenodo.3952444"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Elffers, J., Nordstr\u00f6m, J.: Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 1291\u20131299 (2018)","DOI":"10.24963\/ijcai.2018\/180"},{"key":"10_CR15","unstructured":"Gecode: Generic constraint development environment. https:\/\/www.gecode.org\/"},{"key":"10_CR16","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Technical report, Optimization Online (2019). http:\/\/www.optimization-online.org\/DB_HTML\/2019\/07\/7285.html"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Koch, T., et al.: MIPLIB 2010. Math. Programm. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9, http:\/\/mpc.zib.de\/index.php\/MPC\/article\/view\/56\/28","DOI":"10.1007\/s12532-011-0025-9"},{"key":"10_CR18","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisfiability Boolean Model. Comput. 7, 59\u201364 (2010)"},{"key":"10_CR19","unstructured":"Levin, L.A.: Universal sequential search problems. Problemy peredachi informatsii 9(3), 115\u2013116 (1973). (in Russian). http:\/\/mi.mathnet.ru\/ppi914"},{"key":"10_CR20","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999). Preliminary version in ICCAD 1996"},{"key":"10_CR21","unstructured":"MIPLIB 2.0 (1996). http:\/\/miplib2010.zib.de\/miplib2\/miplib2.html"},{"key":"10_CR22","unstructured":"MIPLIB 2017 (2018). http:\/\/miplib.zib.de"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"10_CR24","unstructured":"Pseudo-Boolean competition 2016 (2016). http:\/\/www.cril.univ-artois.fr\/PB16\/"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"10_CR26","unstructured":"RoundingSat. https:\/\/gitlab.com\/miao_research\/roundingsat"},{"key":"10_CR27","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: a modern pseudo-Boolean SAT solver. In: Proceedings of the Design, Automation and Test in Europe Conference (DATE 2005), pp. 684\u2013685 (2005)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: a hybrid pseudo-Boolean SAT solver. J. Satisfiability Boolean Model. Comput. 2(1\u20134), 165\u2013189 (2006). Preliminary version in DATE 2005","DOI":"10.3233\/SAT190020"},{"key":"10_CR29","unstructured":"Global constraint catalog: sum\\_set. https:\/\/sofdem.github.io\/gccat\/gccat\/Csum_set.html"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Zhang, H., Stickel, M.: Implementing the Davis-Putnam method. J. Autom. Reasoning 24(1), 277\u2013296 (2000). https:\/\/doi.org\/10.1023\/A:1006351428454, https:\/\/doi.org\/10.1023\/A:1006351428454","DOI":"10.1023\/A:1006351428454"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T14:41:46Z","timestamp":1619188906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_10","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)"}}]}}