{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:25Z","timestamp":1759638325674},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,14]],"date-time":"2010-01-14T00:00:00Z","timestamp":1263427200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-009-0680-7","type":"journal-article","created":{"date-parts":[[2010,1,13]],"date-time":"2010-01-13T12:02:14Z","timestamp":1263384134000},"page":"209-231","source":"Crossref","is-referenced-by-count":4,"title":["Leveraging belief propagation, backtrack search, and\u00a0statistics for model counting"],"prefix":"10.1007","volume":"184","author":[{"given":"Lukas","family":"Kroc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,14]]},"reference":[{"key":"680_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.2648","volume":"34","author":"F. Bacchus","year":"2009","unstructured":"Bacchus, F., Dalmao, S., & Pitassi, T. (2009). Solving #SAT and Bayesian inference with backtracking search. Journal of Artificial Intelligence Research, 34, 391\u2013442.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"680_CR2","unstructured":"Bayardo, R. J.\u00a0Jr., Pehoushek, J.\u00a0D. (2000). Counting models using connected components. In Proceedings of AAAI-00: 17th national conference on artificial intelligence (pp.\u00a0157\u2013162), Austin, TX, July."},{"key":"680_CR3","unstructured":"Darwiche, A. (2004). New advances in compiling CNF into decomposable negation normal form. In Proceedings of ECAI-04: 16th European conference on artificial intelligence, Valencia, Spain, Aug. (pp.\u00a0328\u2013332)."},{"key":"680_CR4","unstructured":"Darwiche, A. (2005). The quest for efficient probabilistic inference, July 2005. Invited talk. In IJCAI-05."},{"key":"680_CR5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5, 394\u2013397.","journal-title":"Communications of the ACM"},{"key":"680_CR6","first-page":"201","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Communications of the ACM, 7, 201\u2013215.","journal-title":"Communications of the ACM"},{"key":"680_CR7","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2005). MiniSat: a SAT solver with conflict-clause minimization. In Proceedings of SAT-05: 8th international conference on theory and applications of satisfiability testing, St. Andrews, UK, June."},{"key":"680_CR8","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1968","unstructured":"Feller, W. (1968). An introduction to probability theory and its applications (3rd edn., Vol.\u00a01). New York: Wiley.","edition":"3"},{"key":"680_CR9","unstructured":"Gogate, V., & Dechter, R. (2007). Approximate counting by sampling the backtrack-free search space. In Proceedings of AAAI-07: 22nd conference on artificial intelligence, Vancouver, BC, July (pp.\u00a0198\u2013203)."},{"key":"680_CR10","unstructured":"Gomes, C. P., Sabharwal, A., & Selman, B. (2006). Model counting: a new strategy for obtaining good bounds. In Proceedings of AAAI-06: 21st conference on artificial intelligence, Boston, MA, July (pp.\u00a054\u201361)."},{"key":"680_CR11","unstructured":"Gomes, C. P., Hoffmann, J., Sabharwal, A., & Selman, B. (2007a). From sampling to model counting. In Proceedings of IJCAI-07: 20th international joint conference on artificial intelligence, Hyderabad, India, Jan. (pp.\u00a02293\u20132299)."},{"key":"680_CR12","unstructured":"Gomes, C. P., van Hoeve, W.-J., Sabharwal, A., & Selman, B. (2007b). Counting CSP solutions using generalized XOR constraints. In Proceedings of AAAI-07: 22nd conference on artificial intelligence, Vancouver, BC, July (pp.\u00a0204\u2013209)."},{"key":"680_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/11814948_31","volume-title":"Proceedings of SAT-06: 9th international conference on theory and applications of satisfiability testing","author":"E. I. Hsu","year":"2006","unstructured":"Hsu, E. I., & McIlraith, S. A. (2006). Characterizing propagation methods for boolean satisfiability. In Lecture notes in computer science : Vol. 4121. Proceedings of SAT-06: 9th international conference on theory and applications of satisfiability testing, Seattle, WA, August 2006 (pp. 325\u2013338). Berlin: Springer."},{"key":"680_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-68155-7_12","volume-title":"CP-AI-OR-08: 5th international conference on integration of AI and OR techniques in constraint programming","author":"L. Kroc","year":"2008","unstructured":"Kroc, L., Sabharwal, A., & Selman, B. (2008). Leveraging belief propagation, backtrack search, and statistics for model counting. In Lecture notes in computer science : Vol. 5015. CP-AI-OR-08: 5th international conference on integration of AI and OR techniques in constraint programming, Paris, France, May 2008 (pp. 127\u2013141). Berlin: Springer."},{"issue":"3","key":"680_CR15","doi-asserted-by":"crossref","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. (2001). Stochastic Boolean satisfiability. Journal of Automated Reasoning, 27(3), 251\u2013296.","journal-title":"Journal of Automated Reasoning"},{"issue":"4","key":"680_CR16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1255443.1255445","volume":"54","author":"E. Maneva","year":"2007","unstructured":"Maneva, E., Mossel, E., & Wainwright, M. J. (2007). A new look at survey propagation and its generalizations. Journal of the ACM, 54(4), 17.","journal-title":"Journal of the ACM"},{"key":"680_CR17","unstructured":"Mooij, J. M., Wemmenhove, B., Kappen, H. J., & Rizzo, T. (2007). Loop corrected belief propagation. In Proceedings of AISTATS-07: 11th international conference on artificial intelligence and statistics, San Juan, Puerto Rico, Mar."},{"key":"680_CR18","unstructured":"Park, J. D. (2002). MAP complexity results and approximation methods. In Proceedings of UAI-02: 18th conference on uncertainty in artificial intelligence, Edmonton, Canada, Aug. (pp.\u00a0388\u2013396)."},{"key":"680_CR19","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. San Mateo: Morgan Kaufmann."},{"key":"680_CR20","unstructured":"Pipatsrisawat, K., & Darwiche, A. (2006). RSat 1.03: SAT solver description (Technical Report D\u2013152). Automated Reasoning Group, Computer Science Department, UCLA."},{"key":"680_CR21","doi-asserted-by":"crossref","unstructured":"Pretti, M. (2005). A message-passing algorithm with damping. Journal of Statistical Mechanics, P11008.","DOI":"10.1088\/1742-5468\/2005\/11\/P11008"},{"issue":"1\u20132","key":"680_CR22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D. (1996). On the hardness of approximate reasoning. Artificial Intelligence, 82(1\u20132), 273\u2013302.","journal-title":"Artificial Intelligence"},{"key":"680_CR23","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H. A., & Pitassi, T. (2004). Combining component caching and clause learning for effective model counting. In Proceedings of SAT-04: 7th international conference on theory and applications of satisfiability testing, Vancouver, BC, May."},{"key":"680_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/11499107_17","volume-title":"Proceedings of SAT-05: 8th international conference on theory and applications of satisfiability testing","author":"T. Sang","year":"2005","unstructured":"Sang, T., Beame, P., & Kautz, H. A. (2005a). Heuristics for fast exact model counting. In Lecture Notes in Computer Science : Vol. 3569. Proceedings of SAT-05: 8th international conference on theory and applications of satisfiability testing, St. Andrews, UK, June 2005 (pp. 226\u2013240). Berlin: Springer."},{"key":"680_CR25","unstructured":"Sang, T., Beame, P., & Kautz, H. A. (2005b). Performing Bayesian inference by weighted model counting. In Proceedings of AAAI-05: 20th national conference on artificial intelligence, Pittsburgh, PA, July (pp.\u00a0475\u2013482)."},{"key":"680_CR26","series-title":"DIMACS series in discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","volume-title":"Cliques, coloring and satisfiability: the second DIMACS implementation challenge","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kautz, H., & Cohen, B. (1996). Local search strategies for satisfiability testing. In D. S. Johnson, & M. A. Trick (Eds.) DIMACS series in discrete mathematics and theoretical computer science : Vol. 26. Cliques, coloring and satisfiability: the second DIMACS implementation challenge (pp. 521\u2013532). Providence: American Mathematical Society."},{"key":"680_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9780203910894","volume-title":"Testing for normality","author":"H. C. Thode","year":"2002","unstructured":"Thode, H. C. (2002). Testing for normality. Boca Raton: CRC Press."},{"key":"680_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"Valiant, L. G. (1979). The complexity of computing the permanent. Theoretical Computer Science, 8, 189\u2013201.","journal-title":"Theoretical Computer Science"},{"key":"680_CR29","unstructured":"Wei, W., Erenrich, J., & Selman, B. (2004). Towards efficient sampling: Exploiting random walk strategies. In Proceedings of AAAI-04: 19th national conference on artificial intelligence, San Jose, CA, July (pp.\u00a0670\u2013676)."},{"key":"680_CR30","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/11499107_24","volume-title":"Proceedings of SAT-05: 8th international conference on theory and applications of satisfiability testing","author":"W. Wei","year":"2005","unstructured":"Wei, W., & Selman, B. (2005). A new approach to model counting. In Lecture notes in computer science : Vol. 3569. Proceedings of SAT-05: 8th international conference on theory and applications of satisfiability testing, St. Andrews, UK, June 2005 (pp. 324\u2013339). Berlin: Springer."},{"key":"680_CR31","unstructured":"Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000). Generalized belief propagation. In Proceedings of NIPS-00: 14th conference on advances in neural information processing systems, Denver, CO, Nov. (pp.\u00a0689\u2013695)."},{"issue":"7","key":"680_CR32","doi-asserted-by":"crossref","first-page":"2282","DOI":"10.1109\/TIT.2005.850085","volume":"51","author":"J. S. Yedidia","year":"2005","unstructured":"Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005). Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7), 2282\u20132312.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"680_CR33","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1162\/08997660260028674","volume":"14","author":"A. L. Yuille","year":"2002","unstructured":"Yuille, A. L. (2002). CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation. Neural Computation, 14(7), 1691\u20131722.","journal-title":"Neural Computation"},{"key":"680_CR34","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1002\/(SICI)1097-0258(19970415)16:7<783::AID-SIM488>3.0.CO;2-2","volume":"16","author":"X.-H. Zhou","year":"1997","unstructured":"Zhou, X.-H., & Sujuan, G. (1997). Confidence intervals for the log-normal mean. Statistics In Medicine, 16, 783\u2013790.","journal-title":"Statistics In Medicine"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0680-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0680-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0680-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:59Z","timestamp":1559153279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0680-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,14]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0680-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,14]]}}}