{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T22:25:48Z","timestamp":1789943148675,"version":"4.0.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10472-011-9260-z","type":"journal-article","created":{"date-parts":[[2011,11,17]],"date-time":"2011-11-17T14:34:29Z","timestamp":1321540469000},"page":"159-183","source":"Crossref","is-referenced-by-count":7,"title":["Most Relevant Explanation: computational complexity and approximation methods"],"prefix":"10.1007","volume":"61","author":[{"given":"Changhe","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heejin","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael L.","family":"Littman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,11,18]]},"reference":[{"key":"9260_CR1","first-page":"11","volume-title":"Proceedings, 16th Annual Conference on Uncertainty in Artificial Intelligence (UAI-00)","author":"C Andrieu","year":"2000","unstructured":"Andrieu, C., de\u00a0Freitas, N., Doucet, A.: Reversible jump MCMC simulated annealing for neural networks. In: Proceedings, 16th Annual Conference on Uncertainty in Artificial Intelligence (UAI-00), pp. 11\u201318. Morgan Kaufmann, San Francisco (2000)"},{"key":"9260_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: Proceedings, 3rd Annual ACM Symposium on Theory of Computing, pp.\u00a0151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"9260_CR3","unstructured":"Fitelson, B.: Studies in Bayesian Confirmation Theory. Ph.D. thesis, Philosophy Department, University of Wisconsin, Madison (2001)"},{"key":"9260_CR4","doi-asserted-by":"crossref","unstructured":"Fitelson, B.: Likelihoodism, Bayesianism, and relational confirmation. Synthese 156(3), 473\u2013489 (2007)","DOI":"10.1007\/s11229-006-9134-9"},{"issue":"4","key":"9260_CR5","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J Gill","year":"1977","unstructured":"Gill, J.: Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6(4), 675\u2013695 (1977)","journal-title":"SIAM J. Comput."},{"key":"9260_CR6","first-page":"249","volume":"2","author":"I Good","year":"1985","unstructured":"Good, I.: Weight of evidence: a brief survey. Bayesian Stat. 2, 249\u2013270 (1985)","journal-title":"Bayesian Stat."},{"key":"9260_CR7","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1093\/biomet\/82.4.711","volume":"82","author":"P Green","year":"1995","unstructured":"Green, P.: Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrica 82, 711\u2013732 (1995)","journal-title":"Biometrica"},{"issue":"4598","key":"9260_CR8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9260_CR9","first-page":"446","volume-title":"Proceedings, Uncertain Reasoning in Artificial Intelligence Track of the Eleventh International Florida Artificial Intelligence Research Symposium (FLAIRS\u201398)","author":"Y Lin","year":"1998","unstructured":"Lin, Y., Druzdzel, M.J.: Relevance-based sequential evidence processing in Bayesian networks. In: Proceedings, Uncertain Reasoning in Artificial Intelligence Track of the Eleventh International Florida Artificial Intelligence Research Symposium (FLAIRS\u201398), pp. 446\u2013450. AAAI Press\/The MIT Press, Menlo Park (1998)"},{"key":"9260_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.505","volume":"9","author":"M Littman","year":"1998","unstructured":"Littman, M., Goldsmith, J., Mundhenk, M.: The computational complexity of probabilistic planning. J. Artif. Intell. Res. 9, 1\u201336 (1998)","journal-title":"J. Artif. Intell. Res."},{"key":"9260_CR11","unstructured":"Lu, T.C., Przytula, K.W.: Focusing strategies for multiple fault diagnosis. In: Proceedings, 19th International FLAIRS Conference (FLAIRS-06), pp. 842\u2013847. Malbourne Beach, FL (2006)"},{"key":"9260_CR12","unstructured":"Molina, L., Belanche, L., Nebot, A.: Feature selection algorithms: a survey and experimental evaluation. In: Proceedings, 2002 IEEE International Conference on Data Mining, pp. 306\u2013313 (2002)"},{"key":"9260_CR13","first-page":"403","volume-title":"Proceedings, 17th Conference on Uncertainty in Artificial Intelligence (UAI-01)","author":"JD Park","year":"2001","unstructured":"Park, J.D., Darwiche, A.: Approximating MAP using local search. In: Proceedings, 17th Conference on Uncertainty in Artificial Intelligence (UAI-01), pp. 403\u2013410. Morgan Kaufmann, San Francisco (2001)"},{"key":"9260_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1613\/jair.1236","volume":"21","author":"JD Park","year":"2004","unstructured":"Park, J.D., Darwiche, A.: Complexity results and approximation strategies for MAP explanations. J. Artif. Intell. Res. 21, 101\u2013133 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"9260_CR15","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, San Mateo (1988)"},{"key":"9260_CR16","unstructured":"Yuan, C.: Some properties of Most Relevant Explanation. In: Proceedings, 21st International Joint Conference on Artificial Intelligence ExaCt Workshop (ExaCt-09), pp. 118\u2013125. Pasadena, CA (2009)"},{"key":"9260_CR17","unstructured":"Yuan, C., Liu, X., Lu, T.C., Lim, H.: Most Relevant Explanation: properties, algorithms, and evaluations. In: Proceedings, 25th Conference on Uncertainty in Artificial Intelligence (UAI-09), pp. 631\u2013638. Montreal, Canada (2009)"},{"key":"9260_CR18","unstructured":"Yuan, C., Lu, T.C.: A general framework for generating multivariate explanations in Bayesian networks. In: Proceedings, 23rd National Conference on Artificial Intelligence (AAAI-08), pp. 1119\u20131124 (2008)"},{"key":"9260_CR19","first-page":"628","volume-title":"Proceedings, 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI\u201304)","author":"C Yuan","year":"2004","unstructured":"Yuan, C., Lu, T., Druzdzel, M.: Annealed MAP. In: Proceedings, 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI\u201304), pp. 628\u2013635. AUAI Press, Arlington (2004)"},{"key":"9260_CR20","first-page":"309","volume":"42","author":"C Yuan","year":"2011","unstructured":"Yuan, C., Lim, H., Lu, T.C.:Most relevant explanation in Bayesian networks. J. Artif. Intell. Res. 42, 309\u2013352 (2011)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9260-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-011-9260-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9260-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T18:40:11Z","timestamp":1560969611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-011-9260-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9260"],"URL":"https:\/\/doi.org\/10.1007\/s10472-011-9260-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}