Best-first AND/OR search for most probable explanations

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 259-266

  Marinescu, Radu ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; BEST-FIRST STRATEGY; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; CONTROL STRATEGIES; DEPTH FIRST; MOST PROBABLE EXPLANATION; PROBABILISTIC NETWORK; SEARCH ALGORITHMS; SEARCH SPACES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

BAYESIAN NETWORKS;

EID: 79851512316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann, 1988.
2. K. Kask and R. Dechter. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 2001.
3. R. Marinescu and R. Dechter. And/or branch-and-bound for graphical models. In IJCAI, pages 224-229, 2005.
4. R. Dechter and R. Mateescu. And/or search spaces for graphical models. Artificial Intelligence, 2006.
5. R. Marinescu and R. Dechter. Memory intensive branch-and-bound search for graphical models. In AAAI, 2006.
6. R. Marinescu and R. Dechter. Best-first and/or search for 0-1 integer programming. In CPAIOR, 2007.
7. R. Marinescu and R. Dechter. And/or branch-and-bound search for pure 0/1 integer linear programming problems. In CPAIOR, pages 152-166, 2006. (Pubitemid 44071057)
8. R. Marinescu and R. Dechter. Best-first and/or search for graphical models. In AAAI, 2007.
9. E. Freuder and M. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI, pages 1076-1078, 1985.
10. *. In Journal of ACM, 32(3):505-536, 1985. (Pubitemid 15507408)
11. Nils J. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.
12. R. Dechter and I. Rish. Mini-buckets: A general scheme for approximating inference. ACM, 2003.
13. A. Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001. (Pubitemid 32196230)
14. T. Sang, P. Beame, and H. Kautz. Solving Bayesian networks by weighted model counting. In AAAI, pages 475-482, 2005.
15. M. Fishelson, N. Dovgolevsky, and D. Geiger. Maximum likelihood haplotyping for general pedigrees. Human Heredity, 2005.
16. P. Chakrabati, S. Ghose, A. Acharya, and S. de Sarkar. Heuristic search in restricted memory. In Artificial Intelligence, 3(41):197-221, 1989. (Pubitemid 20633178)