{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:40:23Z","timestamp":1739187623934,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_35","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"377-390","source":"Crossref","is-referenced-by-count":3,"title":["VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search"],"prefix":"10.1007","author":[{"given":"Eric I.","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheila A.","family":"McIlraith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Dechter, R., Kask, K., Mateescu, R.: Iterative join-graph propagation. In: Proc. of 18th International Conference on Uncertainty in Artificial Intelligence (UAI 2002), Edmonton, Canada, pp. 128\u2013136 (2002)","key":"35_CR1"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A. Braunstein","year":"2005","unstructured":"Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms\u00a027, 201\u2013226 (2005)","journal-title":"Random Structures and Algorithms"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11814948_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"E. Hsu","year":"2006","unstructured":"Hsu, E., McIlraith, S.: Characterizing Propagation Methods for Boolean Satisfiability. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 325\u2013338. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Ricci-Tersenghi, F.: Random formulas have frozen variables. SIAM Journal of Computing (to appear)","key":"35_CR4","DOI":"10.1137\/070680382"},{"unstructured":"Hsu, E.I.: VARSAT SAT-Solver homepage (2008), http:\/\/www.cs.toronto.edu\/~eihsu\/VARSAT\/","key":"35_CR5"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9","volume-title":"Learning in Graphical Models","author":"M. Jordan","year":"1998","unstructured":"Jordan, M., Ghahramani, Z., Jaakkola, T., Saul, L.: An introduction to variational methods for graphical models. In: Jordan, M. (ed.) Learning in Graphical Models. MIT Press, Cambridge (1998)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-30201-8_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"K. Kask","year":"2004","unstructured":"Kask, K., Dechter, R., Gogate, V.: Counting-based look-ahead schemes for constraint satisfaction. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 317\u2013331. Springer, Heidelberg (2004)"},{"unstructured":"Hsu, E., Kitching, M., Bacchus, F., McIlraith, S.: Using EM to find likely assignments for solving CSP\u2019s. In: Proc. of 22nd Conference on Artificial Intelligence (AAAI 2007), Vancouver, Canada (2007)","key":"35_CR9"},{"unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Survey propagation revisited. In: Proc. of 23rd International Conference on Uncertainty in Artificial Intelligence (UAI 2007), Vancouver, Canada (2007)","key":"35_CR10"},{"key":"35_CR11","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo (1988)"},{"doi-asserted-by":"crossref","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory\u00a047(2) (2001)","key":"35_CR12","DOI":"10.1109\/18.910572"},{"issue":"1","key":"35_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society\u00a039(1), 1\u201339 (1977)","journal-title":"Journal of the Royal Statistical Society"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_52","volume-title":"Principles and Practice of Constraint Programming","author":"E. Hsu","year":"2008","unstructured":"Hsu, E., Muise, C., Beck, J.C., McIlraith, S.: Probabilistically estimating backbones and variable bias: Experimental overview. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202. Springer, Heidelberg (2008)"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1255443.1255445","volume":"54","author":"E. Maneva","year":"2007","unstructured":"Maneva, E., Mossel, E., Wainwright, M.: A new look at survey propagation and its generalizations. Journal of the ACM\u00a054(4), 2\u201341 (2007)","journal-title":"Journal of the ACM"},{"unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: Proc. of 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico (2003)","key":"35_CR16"},{"key":"35_CR17","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11402763_4","volume-title":"Recent Advances in Constraints","author":"J.C. Beck","year":"2005","unstructured":"Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol.\u00a03419, pp. 41\u201355. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Braunstein, A., Zecchina, R.: Survey propagation as local equilibrium equations. Journal of Statistical Mechanics: Theory and Experiments\u00a0PO6007 (2004)","key":"35_CR18","DOI":"10.1088\/1742-5468\/2004\/06\/P06007"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/11564751_52","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"R.J. Wallace","year":"2005","unstructured":"Wallace, R.J.: Factor analytic studies of CSP heuristics. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 712\u2013726. Springer, Heidelberg (2005)"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11814948_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"P. Manolios","year":"2006","unstructured":"Manolios, P., Zhang, Y.: Implementing survey propagation on graphics processing units. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 311\u2013324. Springer, Heidelberg (2006)"},{"issue":"1","key":"35_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","volume":"158","author":"W. Zhang","year":"2004","unstructured":"Zhang, W.: Configuration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability. Artificial Intelligence\u00a0158(1), 1\u201326 (2004)","journal-title":"Artificial Intelligence"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-540-74970-7_52","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"A. Zanarini","year":"2007","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 743\u2013757. Springer, Heidelberg (2007)"},{"unstructured":"Fang, H., Ruml, W.: Complete local search for propositional satisfiability. In: Proc. of 19th National Conference on Artificial Intelligence (AAAI 2004), San Jose, CA (2004)","key":"35_CR24"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:13:41Z","timestamp":1739186021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}