메뉴 건너뛰기




Volumn , Issue , 2010, Pages 210-219

Formula-based probabilistic inference

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

EID: 80053147650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (33)
  • 1
    • 0345712235 scopus 로고    scopus 로고
    • Value elimination: Bayesian inference via backtracking search
    • Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Value Elimination: Bayesian Inference via Backtracking Search. In UAI, pages 20-28, 2003.
    • (2003) UAI , pp. 20-28
    • Bacchus, F.1    Dalmao, S.2    Pitassi, T.3
  • 3
    • 0002205556 scopus 로고    scopus 로고
    • Rao-Blackwellisation of sampling schemes
    • doi: 10.1093/biomet/83.1.81
    • George Casella and Christian P. Robert. Rao-Blackwellisation of sampling schemes. Biometrika, 83(1):81-94, 1996. doi: 10.1093/biomet/83.1.81.
    • (1996) Biometrika , vol.83 , Issue.1 , pp. 81-94
    • Casella, G.1    Robert, C.P.2
  • 4
    • 38649102485 scopus 로고    scopus 로고
    • On probabilistic inference by weighted model counting
    • Mark Chavira and Adnan Darwiche. On probabilistic inference by weighted model counting. Artificial Intelligence, 172(6-7): 772-799, 2008.
    • (2008) Artificial Intelligence , vol.172 , Issue.6-7 , pp. 772-799
    • Chavira, M.1    Darwiche, A.2
  • 5
    • 0035250750 scopus 로고    scopus 로고
    • Recursive conditioning
    • DOI 10.1016/S0004-3702(00)00069-2
    • Adnan Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001. ISSN 0004-3702. (Pubitemid 32196230)
    • (2001) Artificial Intelligence , vol.126 , Issue.1-2 , pp. 5-41
    • Darwiche, A.1
  • 6
    • 29344452682 scopus 로고    scopus 로고
    • New advances in compiling CNF into decomposable negation normal form
    • Adnan Darwiche. New Advances in Compiling CNF into Decomposable Negation Normal Form. In ECAI, pages 328-332, 2004.
    • (2004) ECAI , pp. 328-332
    • Darwiche, A.1
  • 7
    • 0033188982 scopus 로고    scopus 로고
    • Bucket elimination: A unifying framework for reasoning
    • DOI 10.1016/S0004-3702(99)00059-4
    • R. Dechter. Bucket elimination: A unifying framework for rea soning. Artificial Intelligence, 113:41-85, 1999. (Pubitemid 30542742)
    • (1999) Artificial Intelligence , vol.113 , Issue.1 , pp. 41-85
    • Dechter, R.1
  • 8
    • 33847283947 scopus 로고    scopus 로고
    • AND/OR search spaces for graphical models
    • DOI 10.1016/j.artint.2006.11.003, PII S000437020600138X
    • R. Dechter and R. Mateescu. AND/OR search spaces for graphical models. Artificial Intelligence, 171(2-3):73-106, 2007. (Pubitemid 46328845)
    • (2007) Artificial Intelligence , vol.171 , Issue.2-3 , pp. 73-106
    • Dechter, R.1    Mateescu, R.2
  • 10
    • 0021518209 scopus 로고
    • Stochastic relaxations, Gibbs distributions and the Bayesian restoration of images
    • Stuart Geman and Donald Geman. Stochastic relaxations, Gibbs distributions and the Bayesian restoration of images. IEEE Transaction on Pattern analysis and Machine Intelligence, 6 (6):721-742, 1984.
    • (1984) IEEE Transaction on Pattern Analysis and Machine Intelligence , vol.6 , Issue.6 , pp. 721-742
    • Geman, S.1    Geman, D.2
  • 12
    • 80053260506 scopus 로고    scopus 로고
    • Approximate inference algorithms for hybrid Bayesian networks with discrete constraints
    • Vibhav Gogate and Rina Dechter. Approximate inference algorithms for hybrid Bayesian networks with discrete constraints. In UAI, pages 209-216, 2005.
    • (2005) UAI , pp. 209-216
    • Gogate, V.1    Dechter, R.2
  • 14
    • 36348989663 scopus 로고    scopus 로고
    • Approximate counting by sampling the backtrack-free search space
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • Vibhav Gogate and Rina Dechter. Approximate counting by sampling the backtrack-free search space. In Proceedings of 22nd Conference on Artificial Intelligence (AAAI), pages 198-203, 2007b. (Pubitemid 350149574)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 198-203
    • Gogate, V.1    Dechter, R.2
  • 16
    • 33750352882 scopus 로고    scopus 로고
    • Streamlined constraint reasoning
    • Carla P. Gomes and Meinolf Sellmann. Streamlined constraint reasoning. In CP, pages 274-289, 2004.
    • (2004) CP , pp. 274-289
    • Gomes, C.P.1    Sellmann, M.2
  • 19
    • 0001006209 scopus 로고
    • Local computation with probabilities on graphical structures and their application to expert systems
    • S.L. Lauritzen and D.J. Spiegelhalter. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50(2):157-224, 1988.
    • (1988) Journal of the Royal Statistical Society, Series B , vol.50 , Issue.2 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.J.2
  • 20
    • 0022659563 scopus 로고
    • Probabilistic logic
    • Nils J. Nilsson. Probabilistic logic. Artif. Intell., 28(1):71-87, 1986.
    • (1986) Artif. Intell. , vol.28 , Issue.1 , pp. 71-87
    • Nilsson, N.J.1
  • 21
    • 0036928389 scopus 로고    scopus 로고
    • Using weighted max-sat engines to solve mpe
    • James D. Park. Using weighted max-sat engines to solve mpe. In AAAI, pages 682-687, 2002.
    • (2002) AAAI , pp. 682-687
    • Park, J.D.1
  • 24
    • 33750705605 scopus 로고    scopus 로고
    • Sound and efficient inference with probabilistic and deterministic dependencies
    • Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
    • Hoifung Poon and Pedro Domingos. Sound and efficient inference with probabilistic and deterministic dependencies. In AAAI, pages 458-463, 2006. (Pubitemid 44705326)
    • (2006) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 458-463
    • Poon, H.1    Domingos, P.2
  • 25
    • 32044466073 scopus 로고    scopus 로고
    • Markov logic networks
    • DOI 10.1007/s10994-006-5833-1
    • Matthew Richardson and Pedro Domingos. Markov logic networks. Machine Learning, 62(1-2):107-136, 2006. ISSN 0885-6125. (Pubitemid 43202307)
    • (2006) Machine Learning , vol.62 , Issue.SPEC. ISS.1-2 , pp. 107-136
    • Richardson, M.1    Domingos, P.2
  • 28
    • 26444512653 scopus 로고    scopus 로고
    • Heuristics for fast exact model counting
    • Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005. Proceedings
    • Tian Sang, Paul Beame, and Henry Kautz. Heuristics for fast exact model counting. In Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 226-240, 2005. (Pubitemid 41425509)
    • (2005) Lecture Notes in Computer Science , vol.3569 , pp. 226-240
    • Sang, T.1    Beame, P.2    Kautz, H.3
  • 29
    • 0026056182 scopus 로고
    • Probabilistic diagnosis using a reformulation of the internist-1/qmr knowledge base i. The probabilistic model and inference algorithms
    • M. Shwe, B. Middleton, D. Heckerman, M. Henrion, E. Horvitz, H. Lehmann, and G. Cooper. Probabilistic diagnosis using a reformulation of the internist-1/qmr knowledge base i. the probabilistic model and inference algorithms. Methods of Information in Medicine, 30:241-255, 1991.
    • (1991) Methods of Information in Medicine , vol.30 , pp. 241-255
    • Shwe, M.1    Middleton, B.2    Heckerman, D.3    Henrion, M.4    Horvitz, E.5    Lehmann, H.6    Cooper, G.7
  • 30
    • 34547366652 scopus 로고    scopus 로고
    • Minisat v1.13-a SAT solver with conflict-clause minimization
    • Niklas Sorensson and Niklas Een. Minisat v1.13-a SAT solver with conflict-clause minimization. In SAT 2005 competition, 2005.
    • (2005) SAT 2005 Competition
    • Sorensson, N.1    Een, N.2
  • 31
    • 26444526219 scopus 로고    scopus 로고
    • A new approach to model counting
    • Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005. Proceedings
    • WeiWei and Bart Selman. A new approach to model counting. In SAT, pages 324-339, 2005. (Pubitemid 41425516)
    • (2005) Lecture Notes in Computer Science , vol.3569 , pp. 324-339
    • Wei, W.1    Selman, B.2
  • 32
    • 23744513375 scopus 로고    scopus 로고
    • Constructing free-energy approximations and generalized belief propagation algorithms
    • DOI 10.1109/TIT.2005.850085
    • Jonathan S. Yedidia, William T. Freeman, and Yair Weiss. Constructing free energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51:2282-2312, 2004. (Pubitemid 41136394)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.7 , pp. 2282-2312
    • Yedidia, J.S.1    Freeman, W.T.2    Weiss, Y.3
  • 33
    • 33748255514 scopus 로고    scopus 로고
    • Importance sampling algorithms for Bayesian networks: Principles and performance
    • DOI 10.1016/j.mcm.2005.05.020, PII S0895717705005443
    • Changhe Yuan and Marek J. Druzdzel. Importance sampling algorithms for Bayesian networks: Principles and performance. Mathematical and Computer Modelling, 43(9-10):1189-1207, 2006. ISSN 0895-7177. (Pubitemid 44316568)
    • (2006) Mathematical and Computer Modelling , vol.43 , Issue.9-10 , pp. 1189-1207
    • Yuan, C.1    Druzdzel, M.J.2


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