{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:05:08Z","timestamp":1743152708405,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319222639"},{"type":"electronic","value":"9783319222646"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22264-6_19","type":"book-chapter","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T10:33:29Z","timestamp":1440153209000},"page":"295-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Solving Procedure for Stochastic Satisfiability Modulo Theories with Continuous Domain"],"prefix":"10.1007","author":[{"given":"Yang","family":"Gao","sequence":"first","affiliation":[]},{"given":"Martin","family":"Fr\u00e4nzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-78929-1_13","volume-title":"Hybrid Systems: Computation and Control","author":"M Fr\u00e4nzle","year":"2008","unstructured":"Fr\u00e4nzle, M., Hermanns, H., Teige, T.: Stochastic satisfiability modulo theory: a novel technique for the analysis of probabilistic hybrid systems. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 172\u2013186. Springer, Heidelberg (2008)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-68155-7_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Teige","year":"2008","unstructured":"Teige, T., Fr\u00e4nzle, M.: Stochastic satisfiability modulo theories for non-linear arithmetic. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol. 5015, pp. 248\u2013262. Springer, Heidelberg (2008)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci. 31(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR4","first-page":"86","volume":"98","author":"SM Majercik","year":"1998","unstructured":"Majercik, S.M., Littman, M.L.: Maxplan: A new approach to probabilistic planning. AIPS 98, 86\u201393 (1998)","journal-title":"AIPS"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1017584715408","volume":"27","author":"ML Littman","year":"2001","unstructured":"Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic boolean satisfiability. J. Autom. Reasoning 27(3), 251\u2013296 (2001)","journal-title":"J. Autom. Reasoning"},{"key":"19_CR6","unstructured":"Majercik, S.M., Littman, M.L.: Contingent planning under uncertainty via stochastic satisfiability. In: AAAI\/IAAI, pp. 549\u2013556 (1999)"},{"key":"19_CR7","unstructured":"Teige, T.: Stochastic satisfiability modulo theories: a symbolic technique for the analysis of probabilistic hybrid systems. Ph.D thesis, Universit\u00e4t Oldenburg (2012)"},{"issue":"6","key":"19_CR8","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($$\\cal T$$). J. ACM (JACM) 53(6), 937\u2013977 (2006)","journal-title":"J. ACM (JACM)"},{"key":"19_CR9","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P Van Hentenryck","year":"1997","unstructured":"Van Hentenryck, P., McAllester, D., Kapur, D.: Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34(2), 797\u2013827 (1997)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3\u20134","key":"19_CR11","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":"19_CR12","unstructured":"iSAT Homepage. https:\/\/projects.avacs.org\/projects\/isat\/. Accessed February 2015"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10009-014-0329-y","volume":"17","author":"C Ellen","year":"2015","unstructured":"Ellen, C., Gerwinn, S., Fr\u00e4nzle, M.: Statistical model checking for stochastic hybrid systems involving nondeterminism over continuous domains. Int. J. Softw. Tools Technol. Transfer 17(4), 485\u2013504 (2015)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01457934","volume":"104","author":"RC Young","year":"1931","unstructured":"Young, R.C.: The algebra of many-valued quantities. Mathematische Annalen 104(1), 260\u2013290 (1931)","journal-title":"Mathematische Annalen"},{"issue":"2\u20133","key":"19_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF03186528","volume":"26","author":"T Sunaga","year":"2009","unstructured":"Sunaga, T., et al.: Theory of an interval algebra and its application to numerical analysis. Jpn. J. Ind. Appl. Math. 26(2\u20133), 125\u2013143 (2009). [reprint of res. assoc. appl. geom. mem. 2 (1958), 29\u201346]","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"19_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and Applications of Interval Analysis","author":"RE Moore","year":"1979","unstructured":"Moore, R.E., Moore, R.: Methods and Applications of Interval Analysis, vol. 2. SIAM, Philadelphia (1979)"},{"key":"19_CR17","volume-title":"Introduction to Interval Computation","author":"G Alefeld","year":"1984","unstructured":"Alefeld, G., Herzberger, J.: Introduction to Interval Computation. Academic press, New York (1984)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S1574-6526(06)80020-9","volume":"2","author":"F Benhamou","year":"2006","unstructured":"Benhamou, F., Granvilliers, L.: Continuous and interval constraints. Handb. Constraint Prog. 2, 571\u2013603 (2006)","journal-title":"Handb. Constraint Prog."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1132973.1132980","volume":"32","author":"L Granvilliers","year":"2006","unstructured":"Granvilliers, L., Benhamou, F.: Realpaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. (TOMS) 32(1), 138\u2013156 (2006)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-46562-6_37","volume-title":"Perspectives of System Informatics","author":"F Benhamou","year":"2000","unstructured":"Benhamou, F., Langu\u00e9nou, F.G.\u00c9., Christie, M.: An algorithm to compute inner approximations of relations for interval constraints. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol. 1755, pp. 416\u2013423. Springer, Heidelberg (2000)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45622-8_17","volume-title":"Abstraction, Reformulation, and Approximation","author":"X-H Vu","year":"2002","unstructured":"Vu, X.-H., Sam-Haroud, D., Silaghi, M.-C.: Approximation techniques for non-linear problems with continuum of solutions. In: Koenig, S., Holte, R. (eds.) SARA 2002. LNCS (LNAI), vol. 2371, pp. 224\u2013241. Springer, Heidelberg (2002)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Goubault, E., Mullier, O., Putot, S., Kieffer, M.: Inner approximated reachability analysis. In: Proceedings of the 17th international conference on Hybrid systems: computation and control, pp. 163\u2013172. ACM (2014)","DOI":"10.1145\/2562059.2562113"},{"issue":"11","key":"19_CR23","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1016\/j.automatica.2008.03.027","volume":"44","author":"A Abate","year":"2008","unstructured":"Abate, A., Prandini, M., Lygeros, J., Sastry, S.: Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems. Automatica 44(11), 2724\u20132734 (2008)","journal-title":"Automatica"},{"key":"19_CR24","unstructured":"SiSAT Homepage. https:\/\/projects.avacs.org\/projects\/sisat\/. Accessed March 2015"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22264-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:30:05Z","timestamp":1676471405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22264-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319222639","9783319222646"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22264-6_19","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":"22 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}