{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T16:18:19Z","timestamp":1787588299663,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319661575","type":"print"},{"value":"9783319661582","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66158-2_32","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T07:24:38Z","timestamp":1503386678000},"page":"495-511","source":"Crossref","is-referenced-by-count":9,"title":["Combining Stochastic Constraint Optimization and Probabilistic Programming"],"prefix":"10.1007","author":[{"given":"Anna L. D.","family":"Latour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Behrouz","family":"Babaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton","family":"Dries","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelika","family":"Kimmig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Van den Broeck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","unstructured":"Babaki, B., Guns, T., De Raedt, L.: Stochastic constraint programming with and-or branch-and-bound. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (2017, to appear). doi: 10.24963\/ijcai.2017\/76","DOI":"10.24963\/ijcai.2017\/76"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-24465-5_2","volume-title":"Advances in Intelligent Data Analysis XIV","author":"B Babaki","year":"2015","unstructured":"Babaki, B., Guns, T., Nijssen, S., De Raedt, L.: Constraint-based querying for Bayesian network exploration. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds.) IDA 2015. LNCS, vol. 9385, pp. 13\u201324. Springer, Cham (2015). doi: 10.1007\/978-3-319-24465-5_2"},{"key":"32_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4129-7","volume-title":"Mathematical Logic for Computer Science","author":"M Ben-Ari","year":"2012","unstructured":"Ben-Ari, M.: Mathematical Logic for Computer Science, 3rd edn. Springer Publishing Company, Incorported, Heidelberg (2012). doi: 10.1007\/978-1-4471-4129-7","edition":"3"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-68679-8_11","volume-title":"Concurrency, Graphs and Models","author":"S Bistarelli","year":"2008","unstructured":"Bistarelli, S., Rossi, F.: Semiring-based soft constraints. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 155\u2013173. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68679-8_11"},{"issue":"9","key":"32_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993\u20131002 (1996). doi: 10.1109\/12.537122","journal-title":"IEEE Trans. Comput."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Bova, S.: SDDs are exponentially more succinct than OBDDs. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 929\u2013935. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10107"},{"issue":"8","key":"32_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). doi: 10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrainted programming. Manag. Sci. 6, 73\u201379 (1959)","journal-title":"Manag. Sci."},{"issue":"6\u20137","key":"32_CR9","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). doi: 10.1016\/j.artint.2007.11.002","journal-title":"Artif. Intell."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Choi, A., Darwiche, A.: Dynamic minimization of sentential decision diagrams. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2013, pp. 187\u2013194. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8690"},{"issue":"1\u20132","key":"32_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. J. Appl. Non-Class. Log. 11(1\u20132), 11\u201334 (2001). doi: 10.3166\/jancl.11.11-34","journal-title":"J. Appl. Non-Class. Log."},{"key":"32_CR12","doi-asserted-by":"publisher","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI 2011, vol. 2, pp. 819\u2013826. AAAI Press (2011). doi: 10.5591\/978-1-57735-516-8\/IJCAI11-143","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-143"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10994-007-5030-x","volume":"70","author":"L Raedt De","year":"2008","unstructured":"De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., Toivonen, H.: Compressing probabilistic Prolog programs. Mach. Learn. 70(2), 151\u2013168 (2008). doi: 10.1007\/s10994-007-5030-x","journal-title":"Mach. Learn."},{"key":"32_CR14","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic Prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI 2007, pp. 2468\u20132473. Morgan Kaufmann Publishers Inc., San Francisco (2007)"},{"issue":"03","key":"32_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D., Gutmann, B., Thon, I., Janssens, G., De Raedt, L.: Inference and learning in probabilistic logic programs using weighted Boolean formulas. Theory Pract. Log. Program. 15(03), 358\u2013401 (2015). doi: 10.1017\/S1471068414000076","journal-title":"Theory Pract. Log. Program."},{"key":"32_CR16","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137\u2013146. ACM, New York (2003). doi: 10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"7\u20138","key":"32_CR17","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.artint.2010.02.004","volume":"174","author":"M Lombardi","year":"2010","unstructured":"Lombardi, M., Milano, M.: Allocation and scheduling of conditional task graphs. Artif. Intell. 174(7\u20138), 500\u2013529 (2010). doi: 10.1016\/j.artint.2010.02.004","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"32_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-009-9132-y","volume":"54","author":"R Mateescu","year":"2008","unstructured":"Mateescu, R., Dechter, R.: Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1\u20133), 3\u201351 (2008). doi: 10.1007\/s10472-009-9132-y","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02022101","volume":"21","author":"KIM McKinnon","year":"1989","unstructured":"McKinnon, K.I.M., Williams, H.P.: Constructing integer programming models by the predicate calculus. Ann. Oper. Res. 21(1), 227\u2013245 (1989). doi: 10.1007\/BF02022101","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.021544898","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404\u2013409 (2001). doi: 10.1073\/pnas.021544898","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"13","key":"32_CR21","doi-asserted-by":"publisher","first-page":"i359","DOI":"10.1093\/bioinformatics\/btm170","volume":"23","author":"O Ourfali","year":"2007","unstructured":"Ourfali, O., Shlomi, T., Ideker, T., Ruppin, E., Sharan, R.: SPINE: a framework for signaling-regulatory pathway inference from cause-effect experiments. Bioinformatics 23(13), i359\u2013i366 (2007). doi: 10.1093\/bioinformatics\/btm170","journal-title":"Bioinformatics"},{"key":"32_CR22","unstructured":"Pipatsrisawat, K., Darwiche, A.: New compilation languages based on structured decomposability. In: Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 1, pp. 517\u2013522. AAAI Press (2008)"},{"key":"32_CR23","unstructured":"Riedel, S.: Improving the accuracy and efficiency of MAP inference for Markov logic. In: Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, UAI 2008, Helsinki, Finland, 9\u201312 July 2008, pp. 468\u2013475 (2008)"},{"issue":"1\u20132","key":"32_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82(1\u20132), 273\u2013302 (1996). doi: 10.1016\/0004-3702(94)00092-1","journal-title":"Artif. Intell."},{"issue":"1","key":"32_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10479-008-0382-6","volume":"171","author":"SA Tarim","year":"2009","unstructured":"Tarim, S.A., Hnich, B., Prestwich, S.D., Rossi, R.: Finding reliable solutions: event-driven probabilistic constraint programming. Ann. OR 171(1), 77\u201399 (2009). doi: 10.1007\/s10479-008-0382-6","journal-title":"Ann. OR"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Van den Broeck, G., Thon, I., van Otterlo, M., De Raedt, L.: DTPROBLOG: a decision-theoretic probabilistic Prolog. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, pp. 1217\u20131222. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7755"},{"key":"32_CR27","unstructured":"Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2002, Lyon, France, July 2002, pp. 111\u2013115 (2002)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66158-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T05:24:49Z","timestamp":1692941089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66158-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661575","9783319661582"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66158-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}