{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:23:36Z","timestamp":1725578616735},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198342"},{"type":"electronic","value":"9783642198359"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19835-9_16","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T15:03:16Z","timestamp":1300114996000},"page":"189-204","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Base Encodings for Pseudo-Boolean Constraints"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Fuhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-4","key":"16_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190021","volume":"2","author":"O. Bailleux","year":"2006","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation (JSAT)\u00a02(1-4), 191\u2013200 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation (JSAT)"},{"key":"16_CR2","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.\u00a05584, pp. 181\u2013194. Springer, Heidelberg (2009)"},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1315-1","volume-title":"Logic-based 0-1 constraint programming","author":"P. Barth","year":"1996","unstructured":"Barth, P.: Logic-based 0-1 constraint programming. Kluwer Academic Publishers, Norwell (1996)"},{"key":"16_CR4","series-title":"AFIPS Conference Proceedings","first-page":"307","volume-title":"AFIPS Spring Joint Computing Conference","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol.\u00a032, pp. 307\u2013314. Thomson Book Company, Washington, D.C (1968)"},{"key":"16_CR5","first-page":"16","volume":"25","author":"R.E. Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News\u00a025, 16 (1992)","journal-title":"SIAM News"},{"key":"16_CR6","unstructured":"Bryant, R.E., Lahiri, S.K., Seshia, S.A.: Deciding CLU logic formulas via boolean and pseudo-boolean encodings. In: Proc. Intl. Workshop on Constraints in Formal Verification, CFV 2002 (2002)"},{"issue":"1-3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(99)00223-X","volume":"214","author":"B. Chor","year":"2000","unstructured":"Chor, B., Lemke, P., Mador, Z.: On the number of ordered factorizations of natural numbers. Discrete Mathematics\u00a0214(1-3), 123\u2013133 (2000)","journal-title":"Discrete Mathematics"},{"key":"16_CR8","unstructured":"Codish, M., Fekete, Y., Fuhs, C., Schneider-Kamp, P.: Optimal Base Encodings for Pseudo-Boolean Constraints. Technical Report, arXiv:1007.4935 [cs.DM], http:\/\/arxiv.org\/abs\/1007.4935"},{"issue":"1-4","key":"16_CR9","doi-asserted-by":"crossref","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. Journal on Satisfiability, Boolean Modeling and Computation (JSAT)\u00a02(1-4), 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation (JSAT)"},{"key":"16_CR10","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading (1973)"},{"issue":"1-4","key":"16_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/SAT190018","volume":"2","author":"V.M. Manquinho","year":"2006","unstructured":"Manquinho, V.M., Roussel, O.: The first evaluation of Pseudo-Boolean solvers (PB 2005). Journal on Satisfiability, Boolean Modeling and Computation (JSAT)\u00a02(1-4), 103\u2013143 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation (JSAT)"},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"3609","DOI":"10.1007\/BF02175837","volume":"96","author":"N. Sidorov","year":"1999","unstructured":"Sidorov, N.: Sum-of-digits function for certain nonstationary bases. Journal of Mathematical Sciences\u00a096(5), 3609\u20133615 (1999)","journal-title":"Journal of Mathematical Sciences"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19835-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T09:00:30Z","timestamp":1592384430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19835-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198342","9783642198359"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19835-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}