{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:22:34Z","timestamp":1751098954950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_6","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"84-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Single Constant Multiplication for\u00a0SAT"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Bierlee","sequence":"first","affiliation":[]},{"given":"Jip J.","family":"Dekker","sequence":"additional","affiliation":[]},{"given":"Vitaly","family":"Lagoon","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"6_CR1","unstructured":"Ab\u00edo, I., Mayer-Eichberger, V., Stuckey, P.J.: Encoding Linear Constraints into SAT. CoRR abs\/2005.02073 (2020). https:\/\/arxiv.org\/abs\/2005.02073"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TSP.2014.2366713","volume":"63","author":"L Aksoy","year":"2015","unstructured":"Aksoy, L., Flores, P.F., Monteiro, J.: Exact and approximate algorithms for the filter design optimization problem. IEEE Trans. Signal Process. 63(1), 142\u2013154 (2015). https:\/\/doi.org\/10.1109\/TSP.2014.2366713","journal-title":"IEEE Trans. Signal Process."},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Avizienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. EC-10(3), 389\u2013400 (1961). https:\/\/doi.org\/10.1109\/TEC.1961.5219227","DOI":"10.1109\/TEC.1961.5219227"},{"key":"6_CR4","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.) Proc.\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":"6_CR5","doi-asserted-by":"crossref","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, 2 edn. IOS Press (2021). google-Books-ID: dUAvEAAAQBAJ","DOI":"10.3233\/FAIA336"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.L.: Logic minimization algorithms for VLSI synthesis. In: The Kluwer International Series in Engineering and Computer Science, vol. 2. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-1-4613-2821-6","DOI":"10.1007\/978-1-4613-2821-6"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1109\/TASSP.1984.1164433","volume":"32","author":"P Cappello","year":"1984","unstructured":"Cappello, P., Steiglitz, K.: Some complexity issues in digital signal processing. IEEE Trans. Acoust. Speech Signal Process. 32(5), 1037\u20131041 (1984)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Dekker, J.J., Bierlee, H.: Pindakaas: CPAIOR-24 (2024). https:\/\/doi.org\/10.5281\/zenodo.10851856","DOI":"10.5281\/zenodo.10851856"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Gustafsson, O.: Towards optimal multiple constant multiplication: a hypergraph approach. In: 42nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2008, Pacific Grove, CA, USA, 26\u201329 October 2008, pp. 1805\u20131809. IEEE (2008). https:\/\/doi.org\/10.1109\/ACSSC.2008.5074738","DOI":"10.1109\/ACSSC.2008.5074738"},{"issue":"1","key":"6_CR10","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."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Kumm, M.: Optimal constant multiplication using integer linear programming. IEEE Trans. Circuits Syst. II Express Briefs 65-II(5), 567\u2013571 (2018).https:\/\/doi.org\/10.1109\/TCSII.2018.2823780","DOI":"10.1109\/TCSII.2018.2823780"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Ma, S., Ampadu, P.: Optimal SAT-based minimum adder synthesis of linear transformations. In: Lee, H., Geiger, R.L. (eds.) 62nd IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2019, Dallas, TX, USA, 4\u20137 August 2019, pp. 335\u2013338. IEEE (2019). https:\/\/doi.org\/10.1109\/MWSCAS.2019.8885033","DOI":"10.1109\/MWSCAS.2019.8885033"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessiere, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-23219-5_23","volume-title":"CP 2015","author":"P Nightingale","year":"2015","unstructured":"Nightingale, P., Spracklen, P., Miguel, I.: Automatically improving SAT encoding of constraint problems through common subexpression elimination in savile row. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 330\u2013340. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_23"},{"key":"6_CR15","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02. Elsevier (2006). https:\/\/www.sciencedirect.com\/science\/bookseries\/15746526\/2"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"issue":"2","key":"6_CR17","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":"6_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-28228-2_4","volume-title":"PADL 2016","author":"N Zhou","year":"2016","unstructured":"Zhou, N., Kjellerstrand, H.: The Picat-SAT Compiler. In: Gavanelli, M., Reppy, J.H. (eds.) PADL 2016. LNCS, vol. 9585, pp. 48\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-28228-2_4"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-319-66158-2_43","volume-title":"CP 2017","author":"N Zhou","year":"2017","unstructured":"Zhou, N., Kjellerstrand, H.: Optimizing SAT encodings for arithmetic constraints. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 671\u2013686. Springer, Heidelberg (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-60597-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:06:32Z","timestamp":1716818792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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 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":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}