{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:16:42Z","timestamp":1771262202703,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642027765","type":"print"},{"value":"9783642027772","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_45","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"495-508","source":"Crossref","is-referenced-by-count":69,"title":["Algorithms for Weighted Boolean Optimization"],"prefix":"10.1007","author":[{"given":"Vasco","family":"Manquinho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Planes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Aloul, F., Ramani, A., Markov, I., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: An update. In: International Conference on Computer-Aided Design, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Amgoud, L., Cayrol, C., Berre, D.L.: Comparing arguments using preference ordering for argument-based reasoning. In: International Conference on Tools with Artificial Intelligence, pp. 400\u2013403 (1996)","DOI":"10.1109\/TAI.1996.560731"},{"key":"45_CR3","unstructured":"Argelich, J., Li, C.M., Man\u00e0, F.: An improved exact solver for partial max-sat. In: International Conference on Nonconvex Programming: Local and Global Approaches, pp. 230\u2013231 (2007)"},{"key":"45_CR4","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: Third Max-SAT evaluation (2008), http:\/\/www.maxsat.udl.cat\/08\/"},{"key":"45_CR5","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\u00a02, 191\u2013200 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"45_CR6","unstructured":"Barth, P.: A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science (1995)"},{"key":"45_CR7","unstructured":"Berre, D.L.: SAT4J library, http:\/\/www.sat4j.org"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"2","author":"A. Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"8-9","key":"45_CR9","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"M.L. Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: Resolution for Max-SAT. Artificial Intelligence\u00a0171(8-9), 606\u2013618 (2007)","journal-title":"Artificial Intelligence"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B. Borchers","year":"1999","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization\u00a02, 299\u2013306 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Design Automation Conference, pp. 830\u2013835 (2003)","DOI":"10.1145\/775832.776041"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Coudert, O.: On Solving Covering Problems. In: Design Automation Conference, pp. 197\u2013202 (1996)","DOI":"10.1145\/240518.240555"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-74970-7_18","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Darras","year":"2007","unstructured":"Darras, S., Dequen, G., Devendeville, L., Li, C.M.: On inconsistent clause-subsets for Max-SAT solving. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 225\u2013240. Springer, Heidelberg (2007)"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"45_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. Een","year":"2006","unstructured":"Een, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72788-0_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"F. Heras","year":"2007","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: a new weighted Max-SAT solver. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 41\u201355. Springer, Heidelberg (2007)"},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2347","volume":"31","author":"F. Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research\u00a031, 1\u201332 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2-3","key":"45_CR19","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J. Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence\u00a0172(2-3), 204\u2013233 (2008)","journal-title":"Artificial Intelligence"},{"key":"45_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research\u00a030, 321\u2013359 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Liao, S., Devadas, S.: Solving Covering Problems Using LPR-Based Lower Bounds. In: Design Automation Conference, pp. 117\u2013120 (1997)","DOI":"10.1109\/DAC.1997.597128"},{"key":"45_CR22","unstructured":"Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for MAX-SAT solving. In: International Joint Conference on Artificial Intelligence, pp. 2334\u20132339 (2007)"},{"issue":"5","key":"45_CR23","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/43.998623","volume":"21","author":"V. Manquinho","year":"2002","unstructured":"Manquinho, V., Marques-Silva, J.: Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design\u00a021(5), 505\u2013516 (2002)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"45_CR24","doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J.: Effective lower bounding techniques for pseudo-boolean optimization. In: Design, Automation and Test in Europe Conference, pp. 660\u2013665 (2005)","DOI":"10.1109\/DATE.2005.126"},{"key":"45_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-79719-7_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"J. Marques-Silva","year":"2008","unstructured":"Marques-Silva, J., Manquinho, V.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 225\u2013230. Springer, Heidelberg (2008)"},{"key":"45_CR26","unstructured":"Marques-Silva, J., Planes, J.: On using unsatisfiability for solving maximum satisfiability. Computing Research Repository, abs\/0712.0097 (December 2007)"},{"key":"45_CR27","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Testing in Europe Conference, pp. 408\u2013413 (2008)","DOI":"10.1145\/1403375.1403474"},{"key":"45_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11814948_18","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A.: On SAT modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 156\u2013169. Springer, Heidelberg (2006)"},{"key":"45_CR29","doi-asserted-by":"crossref","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. Journal on Satisfiability Boolean Modeling and Computation (JSAT)\u00a04, 191\u2013217 (2008)","journal-title":"Journal on Satisfiability Boolean Modeling and Computation (JSAT)"},{"key":"45_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-74970-7_43","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Ram\u00edrez","year":"2007","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 605\u2013619. Springer, Heidelberg (2007)"},{"key":"45_CR31","doi-asserted-by":"crossref","unstructured":"Safarpour, S., Mangassarian, H., Veneris, A., Liffiton, M.H., Sakallah, K.A.: Improved design debugging using maximum satisfiability. In: Formal Methods in Computer-Aided Design (2007)","DOI":"10.1109\/FMCAD.2007.4401977"},{"key":"45_CR32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/SAT190020","volume":"2","author":"H. Sheini","year":"2006","unstructured":"Sheini, H., Sakallah, K.A.: Pueblo: A hybrid pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 165\u2013189 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"2","key":"45_CR33","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J. Warners","year":"1998","unstructured":"Warners, J.: A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters\u00a068(2), 63\u201369 (1998)","journal-title":"Information Processing Letters"},{"issue":"6","key":"45_CR34","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/TCAD.2003.811450","volume":"22","author":"H. Xu","year":"2003","unstructured":"Xu, H., Rutenbar, R.A., Sakallah, K.A.: sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing. IEEE Transactions on CAD of Integrated Circuits and Systems\u00a022(6), 814\u2013820 (2003)","journal-title":"IEEE Transactions on CAD of Integrated Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T21:25:53Z","timestamp":1589923553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}