{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:45Z","timestamp":1725565425821},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156748"},{"type":"electronic","value":"9783642156755"}],"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-15675-5_2","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T04:07:17Z","timestamp":1284350837000},"page":"7-9","source":"Crossref","is-referenced-by-count":2,"title":["Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference"],"prefix":"10.1007","author":[{"given":"Adnan","family":"Darwiche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Choi, A., Chavira, M., Darwiche, A.: Node splitting: A scheme for generating upper bounds in bayesian networks. In: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI), pp. 57\u201366 (2007)"},{"key":"2_CR2","unstructured":"Choi, A., Darwiche, A.: An edge deletion semantics for belief propagation and its practical impact on approximation quality. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 1107\u20131114 (2006)"},{"key":"2_CR3","unstructured":"Choi, A., Darwiche, A.: Approximating the partition function by deleting and then correcting for model edges. In: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 79\u201387 (2008)"},{"key":"2_CR4","unstructured":"Choi, A., Darwiche, A.: Focusing generalizations of belief propagation on targeted queries. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI), pp. 1024\u20131030 (2008)"},{"key":"2_CR5","unstructured":"Choi, A., Darwiche, A.: Relax then compensate: On max-product belief propagation and more. In: Proceedings of the Twenty-Third Annual Conference on Neural Information Processing Systems (NIPS), pp. 351\u2013359 (2009)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Choi, A., Standley, T., Darwiche, A.: Approximating weighted max-sat problems by compensating for relaxations. In: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP), pp. 211\u2013225 (2009)","DOI":"10.1007\/978-3-642-04244-7_19"},{"key":"2_CR7","unstructured":"Darwiche, A.: A logical approach to factoring belief networks. In: Proceedings of KR, pp. 409\u2013420 (2002)"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/636865.636866","volume":"50","author":"R. Dechter","year":"2003","unstructured":"Dechter, R., Rish, I.: Mini-buckets: A general scheme for bounded inference. Journal of the ACM\u00a050(2), 107\u2013153 (2003)","journal-title":"Journal of the ACM"},{"key":"2_CR10","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo (1988)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lower bound on the size of decomposable negation normal form. In: Proceedings of the 25th National Conference on Artificial Intelligence, AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7600"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190044","volume":"4","author":"K. Pipatsrisawat","year":"2008","unstructured":"Pipatsrisawat, K., Palyan, A., Chavira, M., Choi, A., Darwiche, A.: Solving weighted max-sat problems in a reduced search space: A performance analysis. Journal on Satisfiability Boolean Modeling and Computation (JSAT)\u00a04, 191\u2013217 (2008)","journal-title":"Journal on Satisfiability Boolean Modeling and Computation (JSAT)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: CP, pp. 605\u2013619 (2007)","DOI":"10.1007\/978-3-540-74970-7_43"},{"key":"2_CR14","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. In: Lakemeyer, G., Nebel, B. (eds.) Exploring Artificial Intelligence in the New Millennium, ch.\u00a08, pp. 239\u2013269. Morgan Kaufmann, San Francisco (2003)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T07:53:32Z","timestamp":1685778812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}