AND/OR cutset conditioning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 230-235

  Mateescu, Robert ^a   Dechter, Rina ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUT-SET; GRAPHICAL MODEL; HYBRID ALGORITHMS; NATURAL EXTENSION; REASONING TASKS; SEARCH SPACES;

ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; GRAPHIC METHODS;

INFERENCE ENGINES;

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

References (13)

1. R. Bayardo and D. Miranker. A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In AAAI'96, 1996.
2. B. Bidyuk and R. Dechter. Cycle-cutset sampling for bayesian networks. In The Canadian AI Conference, (CAAI'03), 2003.
3. B. Bidyuk and R. Dechter. On finding minimal w-cutset problem. In UAI'04, 2004.
4. A. Darwiche. Recursive conditioning. Artificial Intelligence Journal, 125(1-2):5-41, 2001. (Pubitemid 32196230)
5. R. Dechter and R. Mateescu. Mixtures of deterministic-probabilistic networks and their AND/OR search space. In UAI'04, 2004.
6. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41:273-312, 1990. (Pubitemid 20647477)
7. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, pages 41-85, 1999. (Pubitemid 30542742)
8. M. Fishelson and D. Geiger. Exact genetic linkage computations for general pedigrees. Bioinformatics, 18(1):189-198, 2002.
9. E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI'85, 1985.
10. U. Kjæaerulff. Triangulation of graph-based algorithms giving small total state space. Technical report, University of Aalborg, Denmark, 1990.
11. J. Larrosa and R. Dechter. Boosting search with variable-elimination. Constraints, pages 407-419, 2002.
12. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
13. I. Rish and R. Dechter. Resolution vs. search; two strategies for sat. Journal of Automated Reasoning, 24(1/2):225-275, 2000. (Pubitemid 30576102)