메뉴 건너뛰기




Volumn 172, Issue 6-7, 2008, Pages 772-799

On probabilistic inference by weighted model counting

Author keywords

Bayesian networks; Compilation; Exact inference; Weighted model counting

Indexed keywords

APPROXIMATION THEORY; BAYESIAN NETWORKS; KNOWLEDGE BASED SYSTEMS; MODEL CHECKING; PARAMETER ESTIMATION; PROBABILITY;

EID: 38649102485     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.11.002     Document Type: Article
Times cited : (398)

References (48)
  • 1
    • 37249053508 scopus 로고    scopus 로고
    • M. Chavira, A. Darwiche, Compiling Bayesian networks with local structure, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 2005, pp. 1306-1312
    • M. Chavira, A. Darwiche, Compiling Bayesian networks with local structure, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 2005, pp. 1306-1312
  • 2
    • 85131704827 scopus 로고    scopus 로고
    • M. Chavira, D. Allen, A. Darwiche, Exploiting evidence in probabilistic inference, in: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI), 2005, pp. 112-119
    • M. Chavira, D. Allen, A. Darwiche, Exploiting evidence in probabilistic inference, in: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI), 2005, pp. 112-119
  • 3
    • 33749561929 scopus 로고    scopus 로고
    • Encoding cnfs to empower component analysis
    • Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT), Springer, Berlin, Heidelberg
    • Chavira M., and Darwiche A. Encoding cnfs to empower component analysis. Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT). Lecture Notes in Computer Science vol. 4121 (2006), Springer, Berlin, Heidelberg 61-74
    • (2006) Lecture Notes in Computer Science , vol.4121 , pp. 61-74
    • Chavira, M.1    Darwiche, A.2
  • 5
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application to expert systems
    • Lauritzen S.L., and Spiegelhalter D.J. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistics Society, Series B 50 2 (1988) 157-224
    • (1988) Journal of Royal Statistics Society, Series B , vol.50 , Issue.2 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.J.2
  • 7
    • 38649109903 scopus 로고    scopus 로고
    • R. Dechter, Bucket elimination: A unifying framework for probabilistic inference, in: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), 1996, pp. 211-219
    • R. Dechter, Bucket elimination: A unifying framework for probabilistic inference, in: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), 1996, pp. 211-219
  • 8
    • 0035250750 scopus 로고    scopus 로고
    • Recursive conditioning
    • Darwiche A. Recursive conditioning. Artificial Intelligence 126 1-2 (2001) 5-41
    • (2001) Artificial Intelligence , vol.126 , Issue.1-2 , pp. 5-41
    • Darwiche, A.1
  • 9
    • 38649086787 scopus 로고    scopus 로고
    • F. Jensen, S.K. Andersen, Approximations in Bayesian belief universes for knowledge based systems, in: Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence (UAI), Cambridge, MA, 1990, pp. 162-169
    • F. Jensen, S.K. Andersen, Approximations in Bayesian belief universes for knowledge based systems, in: Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence (UAI), Cambridge, MA, 1990, pp. 162-169
  • 10
    • 38649122149 scopus 로고    scopus 로고
    • C. Boutilier, N. Friedman, M. Goldszmidt, D. Koller, Context-specific independence in Bayesian networks, in: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), 1996, pp. 115-123
    • C. Boutilier, N. Friedman, M. Goldszmidt, D. Koller, Context-specific independence in Bayesian networks, in: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), 1996, pp. 115-123
  • 11
    • 38649102883 scopus 로고    scopus 로고
    • D. Larkin, R. Dechter, Bayesian inference in the presence of determinism, in: C.M. Bishop, B.J. Frey (Eds.), Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Jan 3-6, 2003, Key West, FL
    • D. Larkin, R. Dechter, Bayesian inference in the presence of determinism, in: C.M. Bishop, B.J. Frey (Eds.), Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Jan 3-6, 2003, Key West, FL
  • 13
    • 38649092469 scopus 로고    scopus 로고
    • D. Heckerman, A tractable inference algorithm for diagnosing multiple diseases, in: Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence, 1989, pp. 174-181
    • D. Heckerman, A tractable inference algorithm for diagnosing multiple diseases, in: Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence, 1989, pp. 174-181
  • 14
    • 4344599161 scopus 로고    scopus 로고
    • Exploiting contextual independence in probabilistic inference
    • Poole D., and Zhang N. Exploiting contextual independence in probabilistic inference. Journal of Artificial Intelligence 18 (2003) 263-313
    • (2003) Journal of Artificial Intelligence , vol.18 , pp. 263-313
    • Poole, D.1    Zhang, N.2
  • 15
    • 38649096688 scopus 로고    scopus 로고
    • A. Darwiche, A logical approach to factoring belief networks, in: Proceedings of KR, 2002, pp. 409-420
    • A. Darwiche, A logical approach to factoring belief networks, in: Proceedings of KR, 2002, pp. 409-420
  • 17
    • 84880886735 scopus 로고    scopus 로고
    • M. Chavira, A. Darwiche, Compiling Bayesian networks using variable elimination, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), 2007, pp. 2443-2449
    • M. Chavira, A. Darwiche, Compiling Bayesian networks using variable elimination, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), 2007, pp. 2443-2449
  • 18
    • 38649084788 scopus 로고    scopus 로고
    • T. Sang, F. Bacchus, P. Beame, H.A. Kautz, T. Pitassi, Combining component caching and clause learning for effective model counting, in: SAT, 2004
    • T. Sang, F. Bacchus, P. Beame, H.A. Kautz, T. Pitassi, Combining component caching and clause learning for effective model counting, in: SAT, 2004
  • 19
    • 26444512653 scopus 로고    scopus 로고
    • T. Sang, P. Beame, H.A. Kautz, Heuristics for fast exact model counting, in: SAT, 2005, pp. 226-240
    • T. Sang, P. Beame, H.A. Kautz, Heuristics for fast exact model counting, in: SAT, 2005, pp. 226-240
  • 20
    • 84887221855 scopus 로고    scopus 로고
    • On the tractability of counting theory models and its application to belief revision and truth maintenance
    • Darwiche A. On the tractability of counting theory models and its application to belief revision and truth maintenance. Journal of Applied Non-Classical Logics 11 1-2 (2001) 11-34
    • (2001) Journal of Applied Non-Classical Logics , vol.11 , Issue.1-2 , pp. 11-34
    • Darwiche, A.1
  • 23
    • 0030120958 scopus 로고    scopus 로고
    • On the hardness of approximate reasoning
    • Roth D. On the hardness of approximate reasoning. Artificial Intelligence 82 1-2 (1996) 273-302
    • (1996) Artificial Intelligence , vol.82 , Issue.1-2 , pp. 273-302
    • Roth, D.1
  • 24
    • 0344550502 scopus 로고    scopus 로고
    • F. Bacchus, S. Dalmao, T. Pitassi, Algorithms and complexity results for #sat and Bayesian inference, in: FOCS, 2003, pp. 340-351
    • F. Bacchus, S. Dalmao, T. Pitassi, Algorithms and complexity results for #sat and Bayesian inference, in: FOCS, 2003, pp. 340-351
  • 25
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • Davis M., Logemann G., and Loveland D. A machine program for theorem proving. CACM 5 (1962) 394-397
    • (1962) CACM , vol.5 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 26
    • 38649103555 scopus 로고    scopus 로고
    • A. Darwiche, New advances in compiling CNF to decomposable negational normal form, in: Proceedings of European Conference on Artificial Intelligence, 2004, pp. 328-332
    • A. Darwiche, New advances in compiling CNF to decomposable negational normal form, in: Proceedings of European Conference on Artificial Intelligence, 2004, pp. 328-332
  • 27
    • 33847283947 scopus 로고    scopus 로고
    • AND/OR search spaces for graphical models
    • Dechter R., and Mateescu R. AND/OR search spaces for graphical models. Artificial Intelligence 171 2-3 (2007) 73-106
    • (2007) Artificial Intelligence , vol.171 , Issue.2-3 , pp. 73-106
    • Dechter, R.1    Mateescu, R.2
  • 28
    • 26444526219 scopus 로고    scopus 로고
    • W. Wei, B. Selman, A new approach to model counting, in: SAT, 2005, pp. 324-339
    • W. Wei, B. Selman, A new approach to model counting, in: SAT, 2005, pp. 324-339
  • 29
    • 9444265261 scopus 로고    scopus 로고
    • W. Wei, J. Erenrich, B. Selman, Towards efficient sampling: Exploiting random walk strategies, in: AAAI, 2004, pp. 670-676
    • W. Wei, J. Erenrich, B. Selman, Towards efficient sampling: Exploiting random walk strategies, in: AAAI, 2004, pp. 670-676
  • 30
    • 38649101931 scopus 로고    scopus 로고
    • R. Bayardo, J. Pehoushek, Counting models using connected components, in: AAAI, 2000, pp. 157-162
    • R. Bayardo, J. Pehoushek, Counting models using connected components, in: AAAI, 2000, pp. 157-162
  • 32
    • 38649128540 scopus 로고    scopus 로고
    • F. Bacchus, S. Dalmao, T. Pitassi, Dpll with caching: A new algorithm for #SAT and Bayesian inference, Electronic Colloquium on Computational Complexity (ECCC) 10 (003)
    • F. Bacchus, S. Dalmao, T. Pitassi, Dpll with caching: A new algorithm for #SAT and Bayesian inference, Electronic Colloquium on Computational Complexity (ECCC) 10 (003)
  • 34
    • 33750348645 scopus 로고    scopus 로고
    • J. Huang, A. Darwiche, Dpll with a trace: From sat to knowledge compilation, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 2005, pp. 156-162
    • J. Huang, A. Darwiche, Dpll with a trace: From sat to knowledge compilation, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 2005, pp. 156-162
  • 36
    • 1642413218 scopus 로고    scopus 로고
    • A differential approach to inference in Bayesian networks
    • Darwiche A. A differential approach to inference in Bayesian networks. Journal of the ACM 50 3 (2003) 280-305
    • (2003) Journal of the ACM , vol.50 , Issue.3 , pp. 280-305
    • Darwiche, A.1
  • 38
    • 0003169306 scopus 로고
    • Logical minimization of multilevel coded functions
    • Mirsalehi M.M., and Gaylord T.K. Logical minimization of multilevel coded functions. Applied Optics 25 (1986) 3078-3088
    • (1986) Applied Optics , vol.25 , pp. 3078-3088
    • Mirsalehi, M.M.1    Gaylord, T.K.2
  • 39
    • 0022818911 scopus 로고
    • Evaluating influence diagrams
    • Shachter R.D. Evaluating influence diagrams. Operations Research 34 6 (1986) 871-882
    • (1986) Operations Research , vol.34 , Issue.6 , pp. 871-882
    • Shachter, R.D.1
  • 42
    • 38649117019 scopus 로고    scopus 로고
    • J. Park, A. Darwiche, Solving map exactly using systematic search, in: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI), 2003, pp. 459-468
    • J. Park, A. Darwiche, Solving map exactly using systematic search, in: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI), 2003, pp. 459-468
  • 43
    • 38649087732 scopus 로고    scopus 로고
    • C. Yuan, T.-C. Lu, M. Druzdzel, Annealed MAP, in: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2004, pp. 628-635
    • C. Yuan, T.-C. Lu, M. Druzdzel, Annealed MAP, in: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2004, pp. 628-635
  • 44
    • 0038558013 scopus 로고    scopus 로고
    • Exact genetic linkage computations for general pedigrees
    • Fishelson M., and Geiger D. Exact genetic linkage computations for general pedigrees. Bioinformatics 18 1 (2002) 189-198
    • (2002) Bioinformatics , vol.18 , Issue.1 , pp. 189-198
    • Fishelson, M.1    Geiger, D.2
  • 45
    • 38649127621 scopus 로고    scopus 로고
    • M. Fishelson, N. Dovgolevsky, D. Geiger, Maximum likelihood haplotyping for general pedigrees, Tech. Rep. CS-2004-13, Technion, Haifa, Israel, 2004
    • M. Fishelson, N. Dovgolevsky, D. Geiger, Maximum likelihood haplotyping for general pedigrees, Tech. Rep. CS-2004-13, Technion, Haifa, Israel, 2004
  • 48
    • 2442671946 scopus 로고    scopus 로고
    • A differential semantics for jointree algorithms
    • Park J., and Darwiche A. A differential semantics for jointree algorithms. Artificial Intelligence 156 (2004) 197-216
    • (2004) Artificial Intelligence , vol.156 , pp. 197-216
    • Park, J.1    Darwiche, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.