{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T09:12:25Z","timestamp":1783674745129,"version":"3.55.0"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_10","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"148-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["From MiniZinc to Optimization Modulo Theories, and Back"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Contaldo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Trentin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Sebastiani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"10_CR1","unstructured":"fzn2omt. \nhttps:\/\/github.com\/PatrickTrentin88\/fzn2omt"},{"key":"10_CR2","unstructured":"Benchmarks, Tools and Data. \nhttp:\/\/disi.unitn.it\/trentin\/resources\/cpaior2020.tar.xz"},{"key":"10_CR3","unstructured":"MathSAT 5. \nhttp:\/\/mathsat.fbk.eu\/"},{"key":"10_CR4","unstructured":"omt2mzn. \nhttps:\/\/github.com\/cespio\/omt2mzn"},{"key":"10_CR5","unstructured":"emzn2fzn Repository. \nhttps:\/\/github.com\/PatrickTrentin88\/emzn2fzn"},{"key":"10_CR6","unstructured":"Sal, symbolic analysis laboratory. \nhttp:\/\/sal.csl.sri.com"},{"key":"10_CR7","unstructured":"SMT-LIB Format for Finite Lists, Sets and Maps. \nhttps:\/\/www.cprover.org\/SMT-LIB-LSM\/"},{"issue":"2","key":"10_CR8","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 18(2), 236\u2013268 (2013). \nhttps:\/\/doi.org\/10.1007\/s10601-012-9131-1","journal-title":"Constraints"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Ara\u00fajo, R., Bessa, I., Cordeiro, L.C., Filho, J.E.C.: SMT-based verification applied to non-convex optimization problems. In: 2016 VI Brazilian Symposium on Computing Systems Engineering (SBESC), November 2016","DOI":"10.1109\/SBESC.2016.010"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10601-010-9105-0","volume":"16","author":"R As\u00edn","year":"2011","unstructured":"As\u00edn, R., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195\u2013221 (2011). \nhttps:\/\/doi.org\/10.1007\/s10601-010-9105-0","journal-title":"Constraints"},{"key":"10_CR11","unstructured":"Barrett, C., Ranise, S., Stump, A., Tinelli, C.: The satisfiability modulo theories library (SMT-LIB) (2010). \nhttp:\/\/www.smtlib.org"},{"key":"10_CR12","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories, vol. 185, chap. 26, pp. 825\u2013885. IOS Press, February 2009"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Bertolissi, C., dos Santos, D.R., Ranise, S.: Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques. In: SACMAT. ACM (2018)","DOI":"10.1145\/3205977.3205982"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-66167-4_9","volume-title":"Frontiers of Combining Systems","author":"Z Bian","year":"2017","unstructured":"Bian, Z., Chudak, F., Macready, W., Roy, A., Sebastiani, R., Varotti, S.: Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 153\u2013171. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66167-4_9"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-662-46681-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Phan, A.-D., Fleckenstein, L.: vZ - an optimizing SMT solver. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 194\u2013199. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_14"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-70545-1_27","volume-title":"Computer Aided Verification","author":"M Bofill","year":"2008","unstructured":"Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: The barcelogic SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 294\u2013298. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70545-1_27"},{"issue":"3","key":"10_CR17","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 17(3), 273\u2013303 (2012). \nhttps:\/\/doi.org\/10.1007\/s10601-012-9123-1","journal-title":"Constraints"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-14186-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"M Bofill","year":"2010","unstructured":"Bofill, M., Suy, J., Villaret, M.: A system for solving constraint satisfaction problems with SMT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 300\u2013305. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14186-7_25"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-319-40970-2_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"L Candeago","year":"2016","unstructured":"Candeago, L., Larraz, D., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Speeding up the constraint-based method in difference logic. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 284\u2013301. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40970-2_18"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3230639","volume":"19","author":"A Cimatti","year":"2018","unstructured":"Cimatti, A., Griggio, A., Irfan, A., Roveri, M., Sebastiani, R.: Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions. ACM Trans. Comput. Logic 19(3), 1\u201352 (2018)","journal-title":"ACM Trans. Comput. Logic"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-36742-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36742-7_7"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11691372_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Collavizza","year":"2006","unstructured":"Collavizza, H., Rueher, M.: Exploration of the capabilities of constraint programming for software verification. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 182\u2013196. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11691372_12"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s10601-009-9089-9","volume":"15","author":"H Collavizza","year":"2010","unstructured":"Collavizza, H., Rueher, M., Van Hentenryck, P.: CPBPV: a constraint-programming framework for bounded program verification. Constraints 15(2), 238\u2013264 (2010). \nhttps:\/\/doi.org\/10.1007\/s10601-009-9089-9","journal-title":"Constraints"},{"key":"10_CR24","unstructured":"Contaldo, F., Trentin, P., Sebastiani, R.: From minizinc to optimization modulo theories, and back (extended version) (2019). \nhttps:\/\/arxiv.org\/abs\/1912.01476"},{"key":"10_CR25","unstructured":"SMTURL: SmtLibav2. \nwww.smtlib.cs.uiowa.edu\/"},{"key":"10_CR26","unstructured":"Elgabou, H.A., Frisch, A.M.: Encoding the lexicographic ordering constraint in SAT modulo theories. In: Proceedings of Thirteenth International Workshop on Constraint Modelling and Reformulation, September 2014"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04244-7_29"},{"key":"10_CR28","unstructured":"Frisch, A.M., Giannaros, P.A.: SAT Encodings of the At-Most-k Constraint Some Old, Some New, Some Fast, Some Slow (2010)"},{"key":"10_CR29","unstructured":"Frisch, A.M., Palah\u00ed, M.: Anomalies in SMT solving: difficulties in modelling combinatorial problems. In: Proceedings of Thirteenth International Workshop on Constraint Modelling and Reformulation, September 2014"},{"key":"10_CR30","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop 2015, 13th International Workshop on Satisfiability Modulo Theories (2015)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-21215-9_9","volume-title":"Tests and Proofs","author":"O Grinchtein","year":"2015","unstructured":"Grinchtein, O., Carlsson, M., Pearson, J.: A constraint optimisation model for analysis of telecommunication protocol logs. In: Blanchette, J.C., Kosmatov, N. (eds.) TAP 2015. LNCS, vol. 9154, pp. 137\u2013154. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21215-9_9"},{"key":"10_CR32","unstructured":"Karpenkov, G.E.: Finding inductive invariants using satisfiability modulo theories and convex optimization. Theses, Universit\u00e9 Grenoble Alpes (2017)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Kov\u00e1sznai, G., Erd\u00e9lyi, B., Bir\u00f3, C.: Investigations of graph properties in terms of wireless sensor network optimization. In: 2018 IEEE International Conference on Future IoT Technologies (Future IoT), January 2018","DOI":"10.1109\/FIOT.2018.8325588"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-09284-3_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"D Larraz","year":"2014","unstructured":"Larraz, D., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Minimal-model-guided approaches to solving polynomial constraints and extensions. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 333\u2013350. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09284-3_25"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10796-018-9858-3","volume":"21","author":"F Leofante","year":"2018","unstructured":"Leofante, F., Abraham, E., Niemueller, T., Lakemeyer, G., Tacchella, A.: Integrated synthesis and execution of optimal plans for multi-robot systems in logistics. Inf. Syst. Front. 21(1), 87\u2013107 (2018)","journal-title":"Inf. Syst. Front."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Li, Y., Albarghouthi, A., Kincad, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: POPL (2014)","DOI":"10.1145\/2535838.2535857"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-69483-2_9","volume-title":"Dependable Software Engineering. Theories, Tools, and Applications","author":"T Liu","year":"2017","unstructured":"Liu, T., Tyszberowicz, S.S., Beckert, B., Taghdiri, M.: Computing exact loop bounds for bounded program verification. In: Larsen, K.G., Sokolsky, O., Wang, J. (eds.) SETTA 2017. LNCS, vol. 10606, pp. 147\u2013163. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69483-2_9"},{"key":"10_CR38","unstructured":"MiniZinc. \nwww.minizinc.org"},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/978-3-662-49674-9_53","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Nadel","year":"2016","unstructured":"Nadel, A., Ryvchin, V.: Bit-vector optimization. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 851\u2013867. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49674-9_53"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"issue":"2","key":"10_CR41","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00766-016-0263-5","volume":"23","author":"CM Nguyen","year":"2016","unstructured":"Nguyen, C.M., Sebastiani, R., Giorgini, P., Mylopoulos, J.: Multi-objective reasoning with constrained goal models. Requirements Eng. 23(2), 189\u2013225 (2016). \nhttps:\/\/doi.org\/10.1007\/s00766-016-0263-5","journal-title":"Requirements Eng."},{"key":"10_CR42","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. 4121, pp. 156\u2013169. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11814948_18"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-73449-9_2","volume-title":"Term Rewriting and Applications","author":"R Nieuwenhuis","year":"2007","unstructured":"Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Challenges in satisfiability modulo theories. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 2\u201318. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73449-9_2"},{"issue":"6","key":"10_CR44","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR45","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009). \nhttps:\/\/doi.org\/10.1007\/s10601-008-9064-x","journal-title":"Constraints"},{"key":"10_CR46","unstructured":"Oliver, R.S., Craciunas, S.S., Steiner, W.: IEEE 802.1Qbv gate control list synthesis using array theory encoding. In: 2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), April 2018"},{"issue":"4","key":"10_CR47","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-65765-3_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S Ratschan","year":"2017","unstructured":"Ratschan, S.: Simulation based computation of certificates for safety of dynamical systems. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 303\u2013317. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-65765-3_17"},{"key":"10_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-23219-5_27","volume-title":"Principles and Practice of Constraint Programming","author":"A Rendl","year":"2015","unstructured":"Rendl, A., Guns, T., Stuckey, P.J., Tack, G.: MiniSearch: a solver-independent meta-search language for MiniZinc. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 376\u2013392. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23219-5_27"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Roselli, S.F., Bengtsson, K., \u00c5kesson, K.: SMT solvers for job-shop scheduling problems: models comparison and performance evaluation. In: 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), August 2018","DOI":"10.1109\/COASE.2018.8560344"},{"issue":"9","key":"10_CR51","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","volume":"29","author":"NW Sawaya","year":"2005","unstructured":"Sawaya, N.W., Grossmann, I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29(9), 1891\u20131913 (2005)","journal-title":"Comput. Chem. Eng."},{"issue":"3\u20134","key":"10_CR52","first-page":"141","volume":"3","author":"R Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. J. Satisf. Boolean Model. Comput. JSAT 3(3\u20134), 141\u2013224 (2007)","journal-title":"J. Satisf. Boolean Model. Comput. JSAT"},{"key":"10_CR53","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-31365-3_38","volume-title":"Automated Reasoning","author":"R Sebastiani","year":"2012","unstructured":"Sebastiani, R., Tomasi, S.: Optimization in SMT with $${\\cal{L}A}$$(Q) cost functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 484\u2013498. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31365-3_38"},{"issue":"2","key":"10_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699915","volume":"16","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Logics 16(2), 1\u201343 (2015)","journal-title":"ACM Trans. Comput. Logics"},{"key":"10_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-21690-4_27","volume-title":"Computer Aided Verification","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Trentin, P.: OptiMathSAT: a tool for optimization modulo theories. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 447\u2013454. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21690-4_27"},{"key":"10_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-46681-0_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Trentin, P.: Pushing the envelope of optimization modulo theories with linear-arithmetic cost functions. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 335\u2013349. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_27"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-54580-5_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Sebastiani","year":"2017","unstructured":"Sebastiani, R., Trentin, P.: On optimization modulo theories, MaxSMT and sorting networks. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 231\u2013248. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54580-5_14"},{"issue":"3","key":"10_CR58","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-018-09508-6","volume":"64","author":"R Sebastiani","year":"2018","unstructured":"Sebastiani, R., Trentin, P.: OptiMathSAT: a tool for optimization modulo theories. J. Autom. Reason. 64(3), 423\u2013460 (2018)","journal-title":"J. Autom. Reason."},{"key":"10_CR59","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.artint.2015.04.002","volume":"244","author":"S Teso","year":"2017","unstructured":"Teso, S., Sebastiani, R., Passerini, A.: Structured learning modulo theories. Artif. Intell. 244, 166\u2013187 (2017)","journal-title":"Artif. Intell."},{"key":"10_CR60","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-030-29436-6_33","volume-title":"Automated Deduction \u2013 CADE 27","author":"P Trentin","year":"2019","unstructured":"Trentin, P., Sebastiani, R.: Optimization modulo the theory of floating-point numbers. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 550\u2013567. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29436-6_33"},{"key":"10_CR61","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.artint.2016.06.002","volume":"238","author":"M Veksler","year":"2016","unstructured":"Veksler, M., Strichman, O.: Learning general constraints in CSP. Artif. Intell. 238, 135\u2013153 (2016)","journal-title":"Artif. Intell."},{"key":"10_CR62","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). \nhttps:\/\/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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:09:09Z","timestamp":1600409349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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 Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}