{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:07:46Z","timestamp":1767236866667,"version":"3.40.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_17","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T01:33:54Z","timestamp":1407893634000},"page":"207-223","source":"Crossref","is-referenced-by-count":6,"title":["Solving Intensional Weighted CSPs by Incremental Optimization with BDDs"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miquel","family":"Palah\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Suy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","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. Journal of Artificial Intelligence Research (JAIR)\u00a045, 443\u2013480 (2012)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary Decision Diagrams. IEEE Transactions on Computers\u00a027(6), 509\u2013516 (1978)","journal-title":"IEEE Transactions on Computers"},{"key":"17_CR3","unstructured":"Ans\u00f3tegui, C., Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: A Proposal for Solving Weighted CSPs with SMT. In: Proceedings of the 10th International Workshop on Constraint Modelling and Reformulation (ModRef 2011), pp. 5\u201319 (2011)"},{"key":"17_CR4","unstructured":"Ans\u00f3tegui, C., Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Satisfiability Modulo Theories: an Efficient Approach for the Resource-Constrained Project Scheduling Problem. In: Proceedings of the 9th Symposium on Abstraction, Reformulation and Approximation (SARA 2011), pp. 2\u20139 (2011)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10601-012-9131-1","volume":"18","author":"C. Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving weighted CSPs with meta-constraints by reformulation into Satisfiability Modulo Theories. Constraints\u00a018(2), 236\u2013268 (2013)","journal-title":"Constraints"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02777-2_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C. Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 427\u2013440. Springer, Heidelberg (2009)"},{"key":"17_CR7","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 825\u2013885. IOS Press (2009)"},{"key":"17_CR8","unstructured":"Bofill, M., Espasa, J., Palah\u00ed, M., Villaret, M.: An extension to Simply for solving Weighted Constraint Satisfaction Problems with Pseudo-Boolean Constraints. In: XII Spanish Conference on Programming and Computer Languages (PROLE 2012), Almer\u00eda, Spain, pp. 141\u2013155 (September 2012)"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M. Bofill","year":"2012","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving constraint satisfaction problems with SAT modulo theories. Constraints\u00a017(3), 273\u2013303 (2012)","journal-title":"Constraints"},{"issue":"1-3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean optimization. Discrete Applied Mathematics\u00a0123(1-3), 155\u2013225 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-12002-2_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Cimatti","year":"2010","unstructured":"Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani, R., Stenico, C.: Satisfiability Modulo the Theory of Costs: Foundations and Applications. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 99\u2013113. Springer, Heidelberg (2010)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-39071-5_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"A. Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: A Modular Approach to MaxSAT Modulo Theories. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol.\u00a07962, pp. 150\u2013165. Springer, Heidelberg (2013)"},{"key":"17_CR13","unstructured":"de Givry, S., Zytnicki, M., Heras, F., Larrosa, J.: Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 84\u201389 (2005)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"17_CR15","unstructured":"Dutertre, B., de Moura, L.: The Yices SMT solver (August 2006), Tool paper available at http:\/\/yices.csl.sri.com\/tool-paper.pdf"},{"issue":"1-4","key":"17_CR16","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)"},{"issue":"1-3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artificial Intelligence\u00a058(1-3), 21\u201370 (1992)","journal-title":"Artificial Intelligence"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-13520-0_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E. Hebrard","year":"2010","unstructured":"Hebrard, E., O\u2019Mahony, E., O\u2019Sullivan, B.: Constraint Programming and Combinatorial Optimisation in Numberjack. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 181\u2013185. Springer, Heidelberg (2010)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Minato, S.-I., Ishiura, N., Yajima, S.: Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation. In: Proceedings of the 27th ACM\/IEEE Conference on Design Automation (DAC 1990), pp. 52\u201357 (1990)","DOI":"10.1145\/123186.123225"},{"issue":"1-2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J. Larrosa","year":"2004","unstructured":"Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining Arc-Consistency. Artificial Intelligence\u00a0159(1-2), 1\u201326 (2004)","journal-title":"Artificial Intelligence"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: SAT Handbook, pp. 131\u2013154 (2009)","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, vol.\u00a09. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80013-1"}],"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-319-10428-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:55:07Z","timestamp":1746334507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}