{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:24:05Z","timestamp":1742948645160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":72,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_6","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"113-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Modulo Theories"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Passerini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"6_CR1","unstructured":"Ahmadi, B., Kersting, K., Sanner, S.: Multi-evidence lifted message passing, with application to pagerank and the kalman filter. In: Proceedings of IJCAI 2011, pp. 1152\u20131158 (2011)"},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7443.001.0001","volume-title":"Predicting Structured Data (Neural Information Processing)","author":"GH Bakir","year":"2007","unstructured":"Bakir, G.H., Hofmann, T., Sch\u00f6lkopf, B., Smola, A.J., Taskar, B., Vishwanathan, S.V.N.: Predicting Structured Data (Neural Information Processing). The MIT Press, Cambridge (2007)"},{"key":"6_CR3","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories, chap. 26, Frontiers in Artificial Intelligence and Applications, pp. 825\u2013885. IOS Press, February 2009"},{"key":"6_CR4","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-1-4419-1665-5_18","volume-title":"Handbook of Metaheuristics","author":"R Battiti","year":"2010","unstructured":"Battiti, R., Brunato, M.: Reactive search optimization: learning while optimizing. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 543\u2013571. Springer, New York (2010)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-22438-6_9","volume-title":"Automated Deduction \u2013 CADE-23","author":"P Baumgartner","year":"2011","unstructured":"Baumgartner, P., Tinelli, C.: Model evolution with equality modulo built-in theories. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 85\u2013100. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22438-6_9"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 141\u2013157. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33558-7_13"},{"key":"6_CR7","unstructured":"Belle, V., Passerini, A., Van den Broeck, G.: Probabilistic inference in hybrid domains by weighted model integration. In: Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI) (2015)"},{"key":"6_CR8","unstructured":"Belle, V., Van den Broeck, G., Passerini, A.: Hashing-based approximate probabilistic inference in hybrid domains. In: Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI) (2015)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000006","volume":"2","author":"Y Bengio","year":"2009","unstructured":"Bengio, Y.: Learning deep architectures for AI. Found. Trends Mach. Learn. 2(1), 1\u2013127 (2009)","journal-title":"Found. Trends Mach. Learn."},{"key":"6_CR10","unstructured":"Bessiere, C., Coletta, R., Hebrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C.-G., Walsh, T.: Constraint acquisition via partial queries. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 475\u2013481. AAAI Press (2013)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-012-5297-4","volume":"90","author":"A Birlutiu","year":"2012","unstructured":"Birlutiu, A., Groot, P., Heskes, T.: Efficiently learning the preferences of people. Mach. Learn. 90, 1\u201328 (2012)","journal-title":"Mach. Learn."},{"key":"6_CR12","unstructured":"Bonilla, E., Guo, S., Sanner, S.: Gaussian process preference elicitation. In: Lafferty, J., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) Advances in Neural Information Processing Systems, pp. 262\u2013270 (2010)"},{"issue":"8\u20139","key":"6_CR13","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.artint.2006.02.003","volume":"170","author":"C Boutilier","year":"2006","unstructured":"Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8\u20139), 686\u2013713 (2006)","journal-title":"Artif. Intell."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Regan, K., Viappiani, P.: Simultaneous elicitation of preference features and utility. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, GA, USA. AAAI Press, pp. 1160\u20131167, July 2010","DOI":"10.1609\/aaai.v24i1.7754"},{"key":"6_CR15","unstructured":"Braziunas, D.: Computational approaches to preference elicitation. Technical report, Department of Computer Science, University of Toronto (2006)"},{"key":"6_CR16","unstructured":"Braziunas, D., Boutilier, C.: Minimax regret based elicitation of generalized additive utilities. In: Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence (UAI 2007), Vancouver, pp. 25\u201332 (2007)"},{"key":"6_CR17","unstructured":"Broecheler, M., Mihalkova, L., Getoor, L.: Probabilistic similarity logic. In: Uncertainty in Artificial Intelligence (UAI), pp. 73\u201382 (2010)"},{"key":"6_CR18","unstructured":"Burges. C.: A tutorial on support vector machines for pattern recognition. In: Data Mining and Knowledge Discovery, vol. 2. Kluwer Academic Publishers, Boston (1998)"},{"key":"6_CR19","unstructured":"Campigotto, P., Battiti, R., Passerini, A.: Learning modulo theories for preference elicitation in hybrid domains. arXiv (2015)"},{"issue":"6\u20137","key":"6_CR20","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.artint.2007.11.002","volume":"172","author":"M Chavira","year":"2008","unstructured":"Chavira, M., Darwiche, A.: On probabilistic inference by weighted model counting. Artif. Intell. 172(6\u20137), 772\u2013799 (2008)","journal-title":"Artif. Intell."},{"key":"6_CR21","unstructured":"Choi, J., Amir, E.: Lifted relational variational inference. In: de\u00a0Freitas, N., Murphy, K.P. (eds.) UAI 2012: Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, pp. 196\u2013206. AUAI Press (2012)"},{"key":"6_CR22","unstructured":"Choi, J., Guzmn-Rivera, A., Amir, E.: Lifted relational kalman filtering. In: Proceedings of IJCAI 2011, pp. 2092\u20132099 (2011)"},{"key":"6_CR23","unstructured":"Choi, J., Hill, D., Amir, E.: Lifted inference for relational continuous models. In: UAI 2010: Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (2010)"},{"key":"6_CR24","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). doi:10.1007\/978-3-642-12002-2_8"},{"key":"6_CR25","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). doi:10.1007\/978-3-642-39071-5_12"},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10994-011-5243-x","volume":"86","author":"M Diligenti","year":"2012","unstructured":"Diligenti, M., Gori, M., Maggini, M., Rigutini, L.: Bridging logic and kernel machines. Mach. Learn. 86(1), 57\u201388 (2012)","journal-title":"Mach. Learn."},{"issue":"7\u20138","key":"6_CR27","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.artint.2011.03.004","volume":"175","author":"C Domshlak","year":"2011","unstructured":"Domshlak, C., H\u00fcllermeier, E., Kaci, S., Prade, H.: Preferences in AI: an overview. Artif. Intell. 175(7\u20138), 1037\u20131052 (2011)","journal-title":"Artif. Intell."},{"issue":"3\u20134","key":"6_CR28","first-page":"209","volume":"1","author":"M Fr\u00e4nzle","year":"2007","unstructured":"Fr\u00e4nzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. JSAT 1(3\u20134), 209\u2013236 (2007)","journal-title":"JSAT"},{"key":"6_CR29","first-page":"102","volume":"32","author":"J Friedman","year":"2004","unstructured":"Friedman, J., Hastie, T., Rosset, S., Tibshirani, R.: Discussion of boosting papers. Ann. Stat. 32, 102\u2013107 (2004)","journal-title":"Ann. Stat."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10472-010-9203-0","volume":"58","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M., Rossi, F., Venable, K., Wilson, N.: Interval-valued soft constraint problems. Ann. Math. Artif. Intell. 58, 261\u2013298 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3\u20134","key":"6_CR31","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.artint.2009.11.015","volume":"174","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies. Artif. Intell. J. 174(3\u20134), 270\u2013294 (2010)","journal-title":"Artif. Intell. J."},{"key":"6_CR32","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)","author":"L Getoor","year":"2007","unstructured":"Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning). The MIT Press, Cambridge (2007)"},{"key":"6_CR33","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: McAllester, D.A., Myllym\u00e4ki, P. (eds.) UAI, pp. 220\u2013229. AUAI Press (2008)"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-24364-6_12","volume-title":"Frontiers of Combining Systems","author":"A Griggio","year":"2011","unstructured":"Griggio, A., Phan, Q.-S., Sebastiani, R., Tomasi, S.: Stochastic local search for SMT: combining theory solvers with WalkSAT. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS (LNAI), vol. 6989, pp. 163\u2013178. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24364-6_12"},{"key":"6_CR35","first-page":"289","volume":"9","author":"S Guo","year":"2010","unstructured":"Guo, S., Sanner, S.: Real-time multiattribute Bayesian preference elicitation with pairwise comparison queries. J. Mach. Learn. Res. - Proc. Track 9, 289\u2013296 (2010)","journal-title":"J. Mach. Learn. Res. - Proc. Track"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-21295-6_12","volume-title":"Inductive Logic Programming","author":"B Gutmann","year":"2011","unstructured":"Gutmann, B., Jaeger, M., Raedt, L.: Extending ProbLog with continuous distributions. In: Frasconi, P., Lisi, F.A. (eds.) ILP 2010. LNCS (LNAI), vol. 6489, pp. 76\u201391. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21295-6_12"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Hausner, A.: Simulating decorative mosaics. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2001, pp. 573\u2013580. ACM, New York (2001)","DOI":"10.1145\/383259.383327"},{"issue":"4\u20135","key":"6_CR38","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1017\/S1471068412000154","volume":"12","author":"MA Islam","year":"2012","unstructured":"Islam, M.A., Ramakrishnan, C.R., Ramakrishnan, I.V.: Inference in probabilistic logic programs with continuous random variables. Theory Pract. Log. Program. 12(4\u20135), 505\u2013523 (2012)","journal-title":"Theory Pract. Log. Program."},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using click through data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 133\u2013142. ACM, New York (2002)","DOI":"10.1145\/775047.775067"},{"issue":"1","key":"6_CR40","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10994-009-5108-8","volume":"77","author":"T Joachims","year":"2009","unstructured":"Joachims, T., Finley, T., Chun-Nam John, Y.: Cutting-plane training of structural SVMs. Mach. Learn. 77(1), 27\u201359 (2009)","journal-title":"Mach. Learn."},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-31365-3_27","volume-title":"Automated Reasoning","author":"D Jovanovi\u0107","year":"2012","unstructured":"Jovanovi\u0107, D., Moura, L.: Solving non-linear arithmetic. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 339\u2013354. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31365-3_27"},{"key":"6_CR42","volume-title":"Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning. The MIT Press, Cambridge (2009)"},{"key":"6_CR43","unstructured":"Kruglov, E.: Superposition modulo theory. Ph.D. thesis, Universit\u00e4t des Saarlandes, Postfach 151141, 66041 Saarbr\u00fccken (2013)"},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-23783-6_18","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"O Ku\u017eelka","year":"2011","unstructured":"Ku\u017eelka, O., Szab\u00f3ov\u00e1, A., Holec, M., \u017delezn\u00fd, F.: Gaussian logic for predictive classification. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6912, pp. 277\u2013292. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23783-6_18"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: ICTAI (1) 2010, pp. 45\u201352 (2010)","DOI":"10.1109\/ICTAI.2010.16"},{"key":"6_CR46","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, Heidelberg (2014). doi:10.1007\/978-3-319-09284-3_25"},{"key":"6_CR47","volume-title":"Predicting Structured Data","author":"Y LeCun","year":"2006","unstructured":"LeCun, Y., Chopra, S., Hadsell, R., Ranzato, M., Huang, F.-J.: A tutorial on energy-based learning. In: Bakir, G., Hofman, T., Sch\u00f6lkopf, B., Smola, A., Taskar, B. (eds.) Predicting Structured Data. MIT Press, Cambridge (2006)"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-76928-6_22","volume-title":"AI 2007: Advances in Artificial Intelligence","author":"L Leenen","year":"2007","unstructured":"Leenen, L., Anbulagan, A., Meyer, T., Ghose, A.: Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring Max-SAT. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 202\u2013212. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-76928-6_22"},{"key":"6_CR49","doi-asserted-by":"crossref","unstructured":"Li, Y., Albarghouthi, A., Kincad, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, pp. 607\u2013618. ACM, New York (2014)","DOI":"10.1145\/2535838.2535857"},{"issue":"18","key":"6_CR50","doi-asserted-by":"publisher","first-page":"2326","DOI":"10.1093\/bioinformatics\/btp421","volume":"25","author":"M Lippi","year":"2009","unstructured":"Lippi, M., Frasconi, P.: Prediction of protein-residue contacts by markov logic networks with grounding-specific weights. Bioinformatics 25(18), 2326\u20132333 (2009)","journal-title":"Bioinformatics"},{"key":"6_CR51","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/3003600","volume":"9","author":"JG March","year":"1978","unstructured":"March, J.G.: Bounded rationality, ambiguity, and the engineering of choice. Bell J. Econ. 9, 587\u2013608 (1978)","journal-title":"Bell J. Econ."},{"volume-title":"Computers and Creativity","year":"2012","key":"6_CR52","unstructured":"McCormack, J., d\u2019Inverno, M. (eds.): Computers and Creativity. Springer, Heidelberg (2012)"},{"key":"6_CR53","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). doi:10.1007\/11814948_18"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Nrman, P., Buschle, M., Knig, J., Johnson, P.: Hybrid probabilistic relational models for system quality analysis. In: EDOC, pp. 57\u201366. IEEE Computer Society (2010)","DOI":"10.1109\/EDOC.2010.29"},{"issue":"2","key":"6_CR55","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10994-015-5483-2","volume":"100","author":"I Ravkic","year":"2015","unstructured":"Ravkic, I., Ramon, J., Davis, J.: Learning relational dependency networks in hybrid domains. Mach. Learn. 100(2), 217\u2013254 (2015)","journal-title":"Mach. Learn."},{"key":"6_CR56","volume-title":"Recommender Systems Handbook","author":"F Ricci","year":"2010","unstructured":"Ricci, F., Rokach, L., Shapira, B., Kantor, P.B.: Recommender Systems Handbook, 1st edn. Springer, New York (2010)","edition":"1"},{"key":"6_CR57","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-89439-1_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"P R\u00fcmmer","year":"2008","unstructured":"R\u00fcmmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274\u2013289. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-89439-1_20"},{"issue":"253","key":"6_CR58","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"LJ Savage","year":"1951","unstructured":"Savage, L.J.: The theory of statistical decision. J. Am. Stat. Assoc. 46(253), 55\u201367 (1951)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3\u20134","key":"6_CR59","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/SAT190034","volume":"3","author":"R Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. J. Satisfiability, Boolean Model. Comput., JSAT 3(3\u20134), 141\u2013224 (2007)","journal-title":"J. Satisfiability, Boolean Model. Comput., JSAT"},{"key":"6_CR60","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{LA}}$$($$\\mathbb{Q}$$) cost functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 484\u2013498. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31365-3_38"},{"issue":"2","key":"6_CR61","doi-asserted-by":"publisher","first-page":"12: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. Logic 16(2), 12:1\u201312:43 (2015)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR62","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, Heidelberg (2015). doi:10.1007\/978-3-319-21690-4_27"},{"key":"6_CR63","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, New York (2004)"},{"key":"6_CR64","unstructured":"Teso, S., Sebastiani, R., Passerini, A.: Structured learning modulo theories. Artif. Intell. (2015)"},{"key":"6_CR65","first-page":"1453","volume":"6","author":"I Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. 6, 1453\u20131484 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR66","volume-title":"Multidiscipline Design Optimization: Textbook","author":"GN Vanderplaats","year":"2007","unstructured":"Vanderplaats, G.N.: Multidiscipline Design Optimization: Textbook. Vanderplaats Research & Development, Incorporated, Colorado Springs (2007)"},{"key":"6_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-642-34413-8_52","volume-title":"Learning and Intelligent Optimization","author":"P Viappiani","year":"2012","unstructured":"Viappiani, P.: Monte Carlo methods for preference learning. In: Hamadi, Y., Schoenauer, M. (eds.) LION 6. LNCS, vol. 7219, pp. 503\u2013508. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34413-8_52"},{"key":"6_CR68","unstructured":"Viappiani, P., Boutilier, C.: Optimal Bayesian recommendation sets and myopically optimal choice query sets. In: Advances in Neural Information Processing Systems 23 (NIPS), Vancouver, pp. 2352\u20132360 (2010)"},{"key":"6_CR69","unstructured":"Wang, J., Domingos, P.: Hybrid Markov logic networks. In: Proceedings of the 23rd National Conference on Artificial Intelligence, vol. 2, AAAI 2008, pp. 1106\u20131111. AAAI Press (2008)"},{"issue":"6","key":"6_CR70","doi-asserted-by":"publisher","first-page":"181:1","DOI":"10.1145\/2508363.2508405","volume":"32","author":"Y-L Yang","year":"2013","unstructured":"Yang, Y.-L., Wang, J., Vouga, E., Wonka, P.: Urban pattern: layout design by hierarchical domain splitting. ACM Trans. Graph. 32(6), 181:1\u2013181:12 (2013)","journal-title":"ACM Trans. Graph."},{"key":"6_CR71","doi-asserted-by":"crossref","unstructured":"Yu, C.-N.J., Joachims, T.: Learning structural SVMs with latent variables. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, pp. 1169\u20131176. ACM, New York (2009)","DOI":"10.1145\/1553374.1553523"},{"issue":"4","key":"6_CR72","doi-asserted-by":"publisher","first-page":"86:1","DOI":"10.1145\/2010324.1964981","volume":"30","author":"L-F Yu","year":"2011","unstructured":"Yu, L.-F., Yeung, S.-K., Tang, C.-K., Terzopoulos, D., Chan, T.F., Osher, S.J.: Make it home: automatic optimization of furniture arrangement. ACM Trans. Graph. 30(4), 86:1\u201386:12 (2011)","journal-title":"ACM Trans. Graph."}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:13:27Z","timestamp":1709820807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}