{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:59:02Z","timestamp":1743080342499,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319216676"},{"type":"electronic","value":"9783319216683"}],"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-21668-3_4","type":"book-chapter","created":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T11:08:53Z","timestamp":1436785733000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Inez Mathematical Programming Modulo Theories Framework"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Manolios","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Pais","sequence":"additional","affiliation":[]},{"given":"Vasilis","family":"Papavasileiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,14]]},"reference":[{"key":"4_CR1","unstructured":"Camlp4. \n                      https:\/\/github.com\/ocaml\/camlp4\/wiki"},{"key":"4_CR2","unstructured":"CPLEX. \n                      http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"4_CR3","unstructured":"Gurobi. \n                      http:\/\/www.gurobi.com"},{"key":"4_CR4","unstructured":"MySQL. \n                      https:\/\/www.mysql.com\/"},{"key":"4_CR5","unstructured":"mysql\\_protocol. \n                      https:\/\/github.com\/slegrand45\/mysql_protocol"},{"key":"4_CR6","unstructured":"SCIP Constraint Handler for Bound Disjunction Constraints. \n                      http:\/\/scip.zib.de\/doc-3.1.1\/html\/cons__bounddisjunction_8h.php"},{"key":"4_CR7","unstructured":"Z3py. \n                      http:\/\/rise4fun.com\/z3py\/tutorial"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"4_CR9","unstructured":"Besson, F.: On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver. In: SMT (2010)"},{"key":"4_CR10","volume-title":"Building and Solving Mathematical Programming Models in Engineering and Science","author":"E Castillo","year":"2002","unstructured":"Castillo, E., Conejo, A., Pedregal, P., Garca, R., Alguacil, N.: Building and Solving Mathematical Programming Models in Engineering and Science. Wiley, Hoboken (2002)"},{"key":"4_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. 6015, pp. 99\u2013113. Springer, Heidelberg (2010)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G Cornuejols","year":"2008","unstructured":"Cornuejols, G.: Valid inequalities for mixed integer linear programs. Math. Program. 112(1), 3\u201344 (2008)","journal-title":"Math. Program."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-79719-7_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"G Faure","year":"2008","unstructured":"Faure, G., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: SAT modulo the theory of linear arithmetic: exact, inexact and commercial solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 77\u201390. Springer, Heidelberg (2008)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. AMS 64, 275\u2013278 (1958)","journal-title":"Bull. AMS"},{"key":"4_CR16","first-page":"1","volume":"8","author":"A Griggio","year":"2012","unstructured":"Griggio, A.: A practical approach to satisfiability modulo linear integer arithmetic. JSAT 8, 1\u201327 (2012)","journal-title":"JSAT"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-22110-1_35","volume-title":"Computer Aided Verification","author":"C Hang","year":"2011","unstructured":"Hang, C., Manolios, P., Papavasileiou, V.: Synthesizing cyber-physical architectural models with real-time constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 441\u2013456. Springer, Heidelberg (2011)"},{"key":"4_CR18","unstructured":"Jones, S.P., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: ICFP (2006)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Koksal, A.S., Kuncak, V., Suter, P.: Constraints as Control. In: POPL (2012)","DOI":"10.1145\/2103656.2103675"},{"key":"4_CR20","unstructured":"Manna, Z., Zarba, C.: Combining Decision Procedures. In: 10th Anniversary Colloquium of UNU\/IIST (2002)"},{"key":"4_CR21","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":"4_CR22","doi-asserted-by":"crossref","unstructured":"Manolios, P., Papavasileiou, V., Riedewald, M.: ILP Modulo Data. In: FMCAD (2014)","DOI":"10.1109\/FMCAD.2014.6987610"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-642-02658-4_42","volume-title":"Computer Aided Verification","author":"D Monniaux","year":"2009","unstructured":"Monniaux, D.: On using floating-point computations to help an exact linear arithmetic decision procedure. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 570\u2013583. Springer, Heidelberg (2009)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Nelson, G., Oppen, D.: Fast Decision Algorithms Based on Union and Find (1977)","DOI":"10.1109\/SFCS.1977.12"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. TOPLAS 1, 245\u2013257 (1979)","journal-title":"TOPLAS"},{"key":"4_CR26","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)"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ic.2006.08.009","volume":"205","author":"R Nieuwenhuis","year":"2007","unstructured":"Nieuwenhuis, R., Oliveras, A.: Fast congruence closure and extensions. Inf. Comput. 205, 557\u2013580 (2007)","journal-title":"Inf. Comput."},{"issue":"6","key":"4_CR28","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). JACM 53(6), 937\u2013977 (2006)","journal-title":"JACM"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/322123.322137","volume":"26","author":"R Shostak","year":"1979","unstructured":"Shostak, R.: A practical decision procedure for arithmetic with function symbols. JACM 26(2), 351\u2013360 (1979)","journal-title":"JACM"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/11532231_16","volume-title":"Automated Deduction \u2013 CADE-20","author":"V Sofronie-Stokkermans","year":"2005","unstructured":"Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Torlak, E., Bodik, R.: A lightweight symbolic virtual machine for solver-aided host languages. In: PLDI (2014)","DOI":"10.1145\/2594291.2594340"}],"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-21668-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T20:12:47Z","timestamp":1563826367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21668-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319216676","9783319216683"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21668-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}