AND/OR search spaces for graphical models

Artificial Intelligence

Volumn 171, Issue 2-3, 2007, Pages 73-106

  Dechter, Rina ^a   Mateescu, Robert ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

AND OR search; Bayesian networks; Constraint networks; Decomposition; Graphical models; Search

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; CONSTRAINT THEORY; GRAPH THEORY; PARAMETER ESTIMATION; PROBABILITY;

BAYESIAN NETWORKS; CONSTRAINT NETWORKS; GRAPHICAL MODELS; PROBABILISTIC INFERENCE;

ARTIFICIAL INTELLIGENCE;

EID: 33847283947     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.11.003     Document Type: Article

References (51)

1. Nilsson N.J. Principles of Artificial Intelligence (1980), Tioga, Palo Alto, CA
2. E.C. Freuder, M.J. Quinn, Taking advantage of stable sets of variables in constraint satisfaction problems, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), 1985, pp. 1076-1078
3. E.C. Freuder, M.J. Quinn, The use of lineal spanning trees to represent constraint satisfaction problems, Tech. Rep. 87-41, University of New Hampshire, Durham (1987)
4. Z. Collin, R. Dechter, S. Katz, On the feasibility of distributed constraint satisfaction, in: Proceedings of the Twelfth International Conference of Artificial Intelligence (IJCAI'91), 1991, pp. 318-324
5. Collin Z., Dechter R., and Katz S. Self-stabilizing distributed constraint satisfaction. The Chicago Journal of Theoretical Computer Science 3 4 (1999) special issue on self-stabilization
6. Modi P.J., Shena W., Tambea M., and Yokoo M. Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161 (2005) 149-180
7. R. Dechter, Constraint networks, in: Encyclopedia of Artificial Intelligence, 1992, pp. 276-285
8. R. Bayardo, D. Miranker, A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), 1996, pp. 298-304
9. J. Larrosa, P. Meseguer, M. Sanchez, Pseudo-tree search with soft constraints, in: Proceedings of the European Conference on Artificial Intelligence (ECAI'02), 2002, pp. 131-135
10. Terrioux C., and Jégou P. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146 (2003) 43-75
11. C. Terrioux, P. Jégou, Bounded backtracking for the valued constraint satisfaction problems, in: Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP'03), 2003, pp. 709-723
12. Darwiche A. Recursive conditioning. Artificial Intelligence 125 1-2 (2001) 5-41
13. F. Bacchus, S. Dalmao, T. Pitassi, Value elimination: Bayesian inference via backtracking search, in: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), 2003, pp. 20-28
14. F. Bacchus, S. Dalmao, T. Pitassi, Algorithms and complexity results for #sat and bayesian inference, in: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), 2003, pp. 340-351
15. T. Sang, F. Bacchus, P. Beam, H. Kautz, T. Pitassi, Combining component caching and clause learning for effective model counting, in: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), 2004
16. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 (1999) 41-85
17. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers 35 (1986) 677-691
18. Darwiche A., and Marquis P. A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR) 17 (2002) 229-264
19. Darwiche A. A differential approach to inference in Bayesian networks. Journal of the ACM 50 3 (2003) 280-305
20. D. McAllester, M. Collins, F. Pereira, Case-factor diagrams for structured probabilistic modeling, in: Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04), 2004, pp. 382-391
21. Fargier H., and Vilarem M. Compiling csps into tree-driven automata for interactive solving. Constraints 9 4 (2004) 263-287
22. V. Bertacco, M. Damiani, The disjunctive decomposition of logic functions, in: ICCAD, International Conference on Computer-Aided Design, 1997, pp. 78-82
23. N. Wilson, Decision diagrams for the computation of semiring valuations, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), 2005, pp. 331-336
24. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 (1989) 353-366
25. Arnborg S.A. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT 25 (1985) 2-23
26. H.L. Bodlaender, J.R. Gilbert, Approximating treewidth, pathwidth and minimum elimination tree-height, Tech. rep., Utrecht University (1991)
27. H.L. Bodlaender, Treewidth: Algorithmic techniques and results, in: The Twenty Second International Symposium on Mathematical Foundations of Computer Science (MFCS'97), 1997, pp. 19-36
28. R. Dechter, A new perspective on algorithms for optimizing policies under uncertainty, in: International Conference on Artificial Intelligence Planning Systems (AIPS-2000), 2000, pp. 72-81
29. Shenoy P. Valuation-based systems for bayesian decision analysis. Operations Research 40 (1992) 463-484
30. Pearl J. Probabilistic Reasoning in Intelligent Systems (1988), Morgan Kaufmann
31. R. Marinescu, R. Dechter, AND/OR branch-and-bound for graphical models, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), 2005, pp. 224-229
32. D. Allen, A. Darwiche, New advances in inference by recursive conditioning, in: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), 2003, pp. 2-10
33. Kask K., Dechter R., Larrosa J., and Dechter A. Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence 166 1-2 (2005) 165-193
34. Dechter R. Constraint Processing (2003), Morgan Kaufmann
35. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 (1987) 1-38
36. Rish I., and Dechter R. Resolution vs. search; two strategies for sat. Journal of Automated Reasoning 24 1/2 (2000) 225-275
37. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41 (1990) 273-312
38. R.J. Bayardo, R.C. Schrag, Using csp look-back techniques to solve real world sat instances, in: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), 1997, pp. 203-208
39. Marques-Silva J.P., and Sakalla K.A. Grasp: A search algorithm for propositional satisfiability. IEEE Transaction on Computers 48 5 (1999) 506-521
40. Robertson N., and Seymour P. Graph minors i. excluding a forest. J. Combin. Theory Ser. B 35 (1983) 39-61
41. Bienstock D., Robertson N., Seymour P., and Thomas R. Quickly excluding a forest. J. Combin. Theory Ser. B 52 (1991) 274-283
42. R. Mateescu, R. Dechter, Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs), in: Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06), 2006, pp. 329-343
43. D.H. Frost, Algorithms and heuristics for constraint satisfaction problems, Tech. rep., Ph.D. thesis, Information and Computer Science, University of California, Irvine (1997)
44. R. Mateescu, R. Dechter, The relationship between AND/OR search and variable elimination, in: Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence (UAI'05), 2005, pp. 380-387
45. Dechter R., and Frost D. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence 136 2 (2002) 147-188
46. J. Huang, A. Darwiche, Dpll with a trace: From sat to knowledge compilation, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), 2005, pp. 156-162
47. McMillan K.L. Symbolic Model Checking (1993), Kluwer Academic
48. K.L. McMillan, Hierarchical representation of discrete functions with application to model checking, in: Computer Aided Verification, 1994, pp. 41-54
49. Gergov J., and Meinel C. Efficient boolean manipulation with obdds can be extended to fbdds. IEEE Trans. Computers 43 (1994) 1197-1209
50. Sieling D., and Wegner I. Graph driven BDDs-a new data structure for boolean functions. Theoretical Computer Science 141 (1994) 283-310
51. R. Brayton, C. McMullen, The decomposition and factorization of boolean expressions, in: ISCAS, Proceedings of the International Symposium on Circuits and Systems, 1982, pp. 49-54