{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:05:38Z","timestamp":1777125938760,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319216898","type":"print"},{"value":"9783319216904","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-21690-4_27","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T06:08:27Z","timestamp":1436940507000},"page":"447-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["OptiMathSAT: A Tool for Optimization Modulo Theories"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Sebastiani","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Trentin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"27_CR1","unstructured":"CGM-Tool. www.cgm-tool.eu"},{"key":"27_CR2","unstructured":"LMT. http:\/\/disi.unitn.it\/teso\/lmt\/lmt.tgz"},{"key":"27_CR3","unstructured":"MathSAT 5. http:\/\/mathsat.fbk.eu\/"},{"key":"27_CR4","unstructured":"OptiMathSAT. http:\/\/optimathsat.disi.unitn.it\/"},{"key":"27_CR5","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, chap. 26, pp. 825\u2013885. IOS Press (2009)"},{"key":"27_CR6","unstructured":"Bjorner, N., Phan, A.-D.: $${\\nu Z}$$ - Maximal satisfaction with Z3. In: Proceedings of SCSS. Invited presentation., Gammart, Tunisia, December 2014. EasyChair Proceedings in Computing (EPiC). http:\/\/www.easychair.org\/publications\/?page=862275542"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bj\u00f8rner, N., Phan, A.-D., Fleckenstein, L.: $${\\nu Z}$$ - An optimizing SMT solver. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 194\u2013199. Springer, Heidelberg (2015, to appear)","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"27_CR8","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. 6015, pp. 99\u2013113. Springer, Heidelberg (2010)"},{"key":"27_CR9","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. 7962, pp. 150\u2013165. Springer, Heidelberg (2013)"},{"key":"27_CR10","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 (ETAPS 2013). LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-31424-7_30","volume-title":"Computer Aided Verification","author":"I Dillig","year":"2012","unstructured":"Dillig, I., Dillig, T., McMillan, K.L., Aiken, A.: Minimum satisfying assignments for SMT. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 394\u2013409. Springer, Heidelberg (2012)"},{"issue":"5","key":"27_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2666357.2597817","volume":"49","author":"J Henry","year":"2014","unstructured":"Henry, J., Asavoae, M., Monniaux, D., Ma\u00efza, C.: How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics. SIGPLAN Not. 49(5), 43\u201352 (2014)","journal-title":"SIGPLAN Not."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Albarghouthi, A., Kincad, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: POPL. ACM Press (2014)","DOI":"10.1145\/2535838.2535857"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-642-39799-8_44","volume-title":"Computer Aided Verification","author":"P Manolios","year":"2013","unstructured":"Manolios, P., Papavasileiou, V.: ILP modulo theories. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 662\u2013677. Springer, Heidelberg (2013)"},{"key":"27_CR16","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)"},{"issue":"7","key":"27_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","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 LA\\mathbb{Q}$$ Cost Functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 484\u2013498. Springer, Heidelberg (2012)"},{"key":"27_CR19","doi-asserted-by":"publisher","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Logics 16(2) (2015). doi: 10.1145\/2699915","DOI":"10.1145\/2699915"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"27_CR21","unstructured":"Teso, S., Sebastiani, R., Passerini, A.: Structured learning modulo theories. Artificial Intelligence (2015). http:\/\/disi.unitn.it\/rseba\/publist.html"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Van Lamsweerde, A.: Goal-oriented requirements engineering: a guided tour. In: Proceedings of the Fifth IEEE International Conference on Requirements Engineering, RE 2001, pp. 249\u2013262. IEEE Computer Society (2001)","DOI":"10.1109\/ISRE.2001.948567"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21690-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T06:29:24Z","timestamp":1748500164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21690-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319216898","9783319216904"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21690-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}