{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:40:01Z","timestamp":1751100001930,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959721","type":"print"},{"value":"9783031959738","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95973-8_8","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:01:08Z","timestamp":1751097668000},"page":"113-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Pseudo-Boolean Encodings from\u00a0an\u00a0Integer Perspective"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-5435","authenticated-orcid":false,"given":"Hendrik","family":"Bierlee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0053-6724","authenticated-orcid":false,"given":"Jip J.","family":"Dekker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-33954-2_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"I Ab\u00edo","year":"2016","unstructured":"Ab\u00edo, I., Gange, G., Mayer-Eichberger, V., Stuckey, P.J.: On CNF encodings of decision diagrams. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 1\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_1"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-23219-5_1","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2015","unstructured":"Ab\u00edo, I., Mayer-Eichberger, V., Stuckey, P.J.: Encoding linear constraints with implication chains to CNF. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 3\u201311. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_1"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-40627-0_9","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2013","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 80\u201396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_9"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for pseudo-boolean constraints. J. Artif. Intell. Res. 45, 443\u2013480 (2012). https:\/\/doi.org\/10.1613\/jair.3653","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-10428-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2014","unstructured":"Ab\u00edo, I., Stuckey, P.J.: Encoding linear constraints into SAT. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 75\u201391. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_9"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108\u2013122. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_8"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02777-2_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"O Bailleux","year":"2009","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-boolean constraints into CNF. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 181\u2013194. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_19"},{"key":"8_CR8","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings\u00a0of SAT Competition 2020 \u2013 Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, 2 edn. IOS Press (2021)","DOI":"10.3233\/FAIA336"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Bierlee, H., Dekker, J.J.: Pindakaas: CPAIOR-25 (submission) (2024). https:\/\/doi.org\/10.5281\/zenodo.14500064","DOI":"10.5281\/zenodo.14500064"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Bierlee, H., Dekker, J.J., Lagoon, V., Stuckey, P.J., Tack, G.: Single constant multiplication for SAT. In: Dilkina, B. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 21st International Conference, CPAIOR 2024, Uppsala, Sweden, 28\u201331 May 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14742, pp. 84\u201398. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-60597-0_6","DOI":"10.1007\/978-3-031-60597-0_6"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Bierlee, H., Gange, G., Tack, G., Dekker, J.J., Stuckey, P.J.: Coupling different integer encodings for SAT. In: Schaus, P. (ed.) Proceedings of the 19th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2022). LNCS, vol. 13292, pp. 44\u201363. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-08011-1_5","DOI":"10.1007\/978-3-031-08011-1_5"},{"key":"8_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103604","volume":"302","author":"M Bofill","year":"2022","unstructured":"Bofill, M., Coll, J., Nightingale, P., Suy, J., Ulrich-Oltean, F., Villaret, M.: SAT encodings for pseudo-boolean constraints together with at-most-one constraints. Artif. Intell. 302, 103604 (2022). https:\/\/doi.org\/10.1016\/j.artint.2021.103604","journal-title":"Artif. Intell."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11941439_9","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"CW Choi","year":"2006","unstructured":"Choi, C.W., Harvey, W., Lee, J., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Sattar, A., Kang, B. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 49\u201358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941439_9"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Cocke, J.: Global common subexpression elimination. In: Northcote, R.S. (ed.) Proceedings of a Symposium on Compiler Optimization, Urbana-Champaign, Illinois, USA, 27\u201328 July 1970, pp. 20\u201324. ACM (1970). https:\/\/doi.org\/10.1145\/800028.808480","DOI":"10.1145\/800028.808480"},{"issue":"1\u20134","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/sat190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2(1\u20134), 1\u201326 (2006). https:\/\/doi.org\/10.3233\/sat190014","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2009.04.006","volume":"37","author":"B Han","year":"2010","unstructured":"Han, B., Leblet, J., Simon, G.: Hard multidimensional multiple choice knapsack problems, an empirical study. Comput. Oper. Res. 37(1), 172\u2013181 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.04.006","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"8","author":"W Harvey","year":"2003","unstructured":"Harvey, W., Stuckey, P.: Improving linear constraint propagation by changing constraint representation. Constraints 8(2), 173\u2013207 (2003)","journal-title":"Constraints"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-33347-7_10","volume-title":"KI 2012: Advances in Artificial Intelligence","author":"S H\u00f6lldobler","year":"2012","unstructured":"H\u00f6lldobler, S., Manthey, N., Steinke, P.: A compact encoding of pseudo-boolean constraints into SAT. In: Glimm, B., Kr\u00fcger, A. (eds.) KI 2012. LNCS (LNAI), vol. 7526, pp. 107\u2013118. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33347-7_10"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Jabs, C., Berg, J., J\u00e4rvisalo, M.: Core boosting in sat-based multi-objective optimization. In: Dilkina, B. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 21st International Conference, CPAIOR 2024, Uppsala, Sweden, 28\u201331 May 2024, Proceedings, Part II. LNCS, vol. 14743, pp. 1\u201319. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-60599-4_1","DOI":"10.1007\/978-3-031-60599-4_1"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-23219-5_15","volume-title":"Principles and Practice of Constraint Programming","author":"S Joshi","year":"2015","unstructured":"Joshi, S., Martins, R., Manquinho, V.: Generalized totalizer encoding for pseudo-boolean constraints. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 200\u2013209. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_15"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding pseudo-boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"key":"8_CR24","unstructured":"Soh, T., Le\u00a0Berre, D., Banbara, M., Tamura, N.: SCOP: sat-based constraint programming system. In: Proceedings of XCSP3 Competition 2018 (XCSP18), pp. 93\u201394 (2018)"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Vandesande, D., Wulf, W.D., Bogaerts, B.: Qmaxsatpb: a certified maxsat solver. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) Logic Programming and Nonmonotonic Reasoning - 16th International Conference, LPNMR 2022, Genova, Italy, 5\u20139 September 2022, Proceedings. LNCS, vol. 13416, pp. 429\u2013442. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_33","DOI":"10.1007\/978-3-031-15707-3_33"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"JP Warners","year":"1998","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63\u201369 (1998). https:\/\/doi.org\/10.1016\/S0020-0190(98)00144-6","journal-title":"Inf. Process. Lett."},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-28228-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"N-F Zhou","year":"2016","unstructured":"Zhou, N.-F., Kjellerstrand, H.: The Picat-SAT compiler. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 48\u201362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28228-2_4"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-319-66158-2_43","volume-title":"Principles and Practice of Constraint Programming","author":"N-F Zhou","year":"2017","unstructured":"Zhou, N.-F., Kjellerstrand, H.: Optimizing SAT encodings for arithmetic constraints. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 671\u2013686. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_43"}],"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-95973-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:01:11Z","timestamp":1751097671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95973-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959721","9783031959738"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95973-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}