{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:49Z","timestamp":1725567589639},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_44","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T08:51:59Z","timestamp":1286182319000},"page":"625-639","source":"Crossref","is-referenced-by-count":6,"title":["Resolution for Stochastic Boolean Satisfiability"],"prefix":"10.1007","author":[{"given":"Tino","family":"Teige","sequence":"first","affiliation":[]},{"given":"Martin","family":"Fr\u00e4nzle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"44_CR1","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci.\u00a031(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"44_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1017584715408","volume":"27","author":"M.L. Littman","year":"2001","unstructured":"Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic Boolean Satisfiability. Journal of Automated Reasoning\u00a027(3), 251\u2013296 (2001)","journal-title":"Journal of Automated Reasoning"},{"unstructured":"Majercik, S.M., Littman, M.L.: MAXPLAN: A New Approach to Probabilistic Planning. In: Artificial Intelligence Planning Systems, pp. 86\u201393 (1998)","key":"44_CR3"},{"issue":"1-2","key":"44_CR4","first-page":"119","volume":"147","author":"S.M. Majercik","year":"2003","unstructured":"Majercik, S.M., Littman, M.L.: Contingent Planning Under Uncertainty via Stochastic Satisfiability. Artificial Intelligence Special Issue on Planning With Uncertainty and Incomplete Information\u00a0147(1-2), 119\u2013162 (2003)","journal-title":"Artificial Intelligence Special Issue on Planning With Uncertainty and Incomplete Information"},{"key":"44_CR5","volume-title":"Proc. of the 15th European Conference on Artificial Intelligence (ECAI 2002)","author":"T. Walsh","year":"2002","unstructured":"Walsh, T.: Stochastic constraint programming. In: Proc. of the 15th European Conference on Artificial Intelligence (ECAI 2002), IOS Press, Amsterdam (2002)"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"A. Tarim","year":"2006","unstructured":"Tarim, A., Manandhar, S., Walsh, T.: Stochastic constraint programming: A scenario-based approach. Constraints\u00a011(1), 53\u201380 (2006)","journal-title":"Constraints"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11889205_6","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T. Balafoutis","year":"2006","unstructured":"Balafoutis, T., Stergiou, K.: Algorithms for Stochastic CSPs. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"44_CR8","first-page":"316","volume-title":"SAC","author":"L. Bordeaux","year":"2007","unstructured":"Bordeaux, L., Samulowitz, H.: On the stochastic constraint satisfaction framework. In: SAC, pp. 316\u2013320. ACM, New York (2007)"},{"key":"44_CR9","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.\u00a04981, pp. 172\u2013186. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: [24], ch.\u00a026, pp. 825\u2013885","key":"44_CR10","DOI":"10.1007\/978-3-319-10575-8_11"},{"unstructured":"Littman, M.L.: Initial Experiments in Stochastic Satisfiability. In: Proc. of the 16th National Conference on Artificial Intelligence, pp. 667\u2013672 (1999)","key":"44_CR11"},{"issue":"3","key":"44_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"44_CR14","first-page":"498","volume-title":"ICTAI","author":"S.M. Majercik","year":"2004","unstructured":"Majercik, S.M.: Nonchronological backtracking in stochastic Boolean satisfiability. In: ICTAI, pp. 498\u2013507. IEEE Computer Society, Los Alamitos (2004)"},{"key":"44_CR15","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: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 248\u2013262. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Teige, T., Eggers, A., Fr\u00e4nzle, M.: Constraint-based analysis of concurrent probabilistic hybrid systems: An application to networked automation systems. Nonlinear Analysis: Hybrid Systems (2010) (to appear)","key":"44_CR16","DOI":"10.1016\/j.nahs.2010.04.009"},{"issue":"1","key":"44_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"issue":"1","key":"44_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H.K. B\u00fcning","year":"1995","unstructured":"B\u00fcning, H.K., Karpinski, M., Fl\u00f6gel, A.: Resolution for quantified Boolean formulas. Inf. Comput.\u00a0117(1), 12\u201318 (1995)","journal-title":"Inf. Comput."},{"unstructured":"Majercik, S.M.: Stochastic Boolean satisfiability. In: [24], vol.\u00a027, pp. 887\u2013925","key":"44_CR19"},{"issue":"3","key":"44_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett.\u00a08(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11549345_36","volume-title":"Mathematical Foundations of Computer Science 2005","author":"J. Goldsmith","year":"2005","unstructured":"Goldsmith, J., Hagen, M., Mundhenk, M.: Complexity of DNF and isomorphism of monotone formulas. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 410\u2013421. Springer, Heidelberg (2005)"},{"key":"44_CR22","first-page":"216","volume-title":"Proc. of the Tenth Annual ACM Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the Tenth Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM, New York (1978)"},{"unstructured":"Silva, J.P.M., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: [24], ch.\u00a04, pp. 131\u2013153","key":"44_CR23"},{"unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (February 2009)","key":"44_CR24"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T02:02:16Z","timestamp":1559700136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}