Climbing the hills of compiled credal networks

ISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications

Volumn , Issue , 2007, Pages 213-222

  Haenni, Rolf ^a,b  

^a BERN UNIVERSITY OF APPLIED SCIENCES   (Switzerland)

^b UNIVERSITY OF BERN   (Switzerland)

Author keywords

Approximate inference; Bayesian networks; Credal networks; Credal sets; Hill climbing; Local search; Logical compilation

Indexed keywords

APPROXIMATE INFERENCE; CREDAL NETWORKS; CREDAL SETS; HILL CLIMBING; LOCAL SEARCH; LOGICAL COMPILATION;

APPROXIMATION ALGORITHMS; BAYESIAN NETWORKS; INFERENCE ENGINES; PROBABILITY;

GRAPHIC METHODS;

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

References (48)

1. A. Antonucci and M. Zaffalon. Locally specified credal networks. In PGM'06, 3rd European Workshop on Probabilistic Graphical Models, pages 25-34, Prague, Czech Republic, 2006.
2. A. Antonucci, M. Zaffalon, J. S. Ide, and F. G. Cozman. Binarization algorithms for approximate updating in credal nets. In STAIRS'06, 3rd European Starting AI Researcher Symposium, pages 120-131, Riva del Garda, Italy, 2006.
3. C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specific independence in Bayesian networks. In UAI'96, 12th Conference on Uncertainty in Artificial Inteligence, pages 115-123, Portland, USA, 1996.
4. A. Cano, J. Cano, and S. Moral. Convex sets of probabilities propagation by simulated annealing on a tree of cliques. IPMU'94, 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, LNCS 945, pages 978-983, Paris, France, 1994. Springer.
5. A. Cano, J. M. Fernández-Luna, and S. Moral. Computing probability intervals with simulated annealing and probability trees. Journal of Applied Non-Classical Logics, 12(2):151-171, 2002.
6. A. Cano, M. Gómez, S. Moral, and J. Abellán. Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. International Journal of Approximate Reasoning, 44(3):261-280, 2007.
7. A. Cano and S. Moral. A genetic algorithm to approximate convex sets of probabilities. In IPMU'96, 6th international Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 859- 864, Granada, Spain, 1996.
8. A. Cano and S. Moral. A review of propagation algorithms for imprecise probabilities. ISIPTA'99, 1st Internation Symposium on Imprecise Probabilities and Their Applications, pages 51-60, Ghent, Belgium, 1999.
9. A. Cano and S. Moral. Using probability trees to compute marginals with imprecise probabilities. International Journal of Approximate Reasoning, 29(1):1-46, 2002.
10. J. E. Cano, S. Moral, and J. F. Verdegay-López. Propagation of convex sets of probabilities in directed acyclic networks. Uncertainty in Intelligent Systems, pages 15-26. North-Holland, 1993.
11. E. Charniak. Bayesian networks without tears. AI Magazine, 12(4):50-63, 1991.
12. M. Chavira and A. Darwiche. Compiling Bayesian networks with local structure. In IJCAI' 05, 19th International Joint Conference on Artificial Intelligence, Edinburgh, U.K., 2005.
13. M. Chavira and A. Darwiche. Compiling Bayesian networks using variable elimination. In IJCAI'07, 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007.
14. M. Chavira, A. Darwiche, and M. Jaeger. Compiling relational Bayesian networks for exact inference. International Journal of Approximate Reasoning, 42(1-2):4-20, 2006.
15. I. Couso, S. Moral, and P. Walley. A survey of concepts of independence for imprecise probabilities. Risk, Decision and Policy, 5(2):165-181, 2000.
16. F. G. Cozman. Credal networks. Artificial Intelligence, 120(2):199-233, 2000.
17. F. G. Cozman. Graphical models for imprecise probabilities. International Journal of Approximate Reasoning, 39(2-3):167-184, 2005.
18. F. G. Cozman and C. P. de Campos. Local computation in credal networks. In ECAI'04, 16th European Conference on Artificial Intelligence, Workshop 22 on "Local Computation for Logics and Uncertainty", pages 5-11, Valencia, Spain, 2004.
19. J. C. F. da Rocha and F. G. Cozman. Inference in credal networks with branch-and-bound algorithms. ISIPTA'03, 3rd International Symposium on Imprecise Probabilities and Their Applications, pages 480-493, Lugano, Switzerland, 2003.
20. J. C. F. da Rocha, F. G. Cozman, and C. P. de Campos. Inference in polytrees with sets of probabilities. UAI'03, 19th Conference on Uncertainty in Artificial Intelligence, pages 217-224, Acapulco, Mexico, 2003.
21. A. Darwiche. A differential approach to inference in Bayesian networks. UAI'00, 16th Conference on Uncertainty in Artificial Intelligence, pages 123-132, Stanford, USA, 2000.
22. A. Darwiche. A compiler for deterministic, decomposable negation normal form. In AAAI'02, 18th National Conference on Artificial Intelligence, pages 627-634, Edmonton, Canada, 2002.
23. A. Darwiche. A logical approach to factoring belief networks. KR'02, 8th International Conference on Principles and Knowledge Representation and Reasoning, pages 409-420, Toulouse, France, 2002.
24. A. Darwiche. New advances in compiling CNF to decomposable negational normal form. In ECAI'04, 16th European Conference on Artificial Intelligence, Valencia, Spain, 2004.
25. A. Darwiche and P. Marquis. A knowlege compilation map. Journal of Artificial Intelligence Research, 17:229-264, 2002.
26. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2nd edition, 2000.
27. C. P. de Campos and F. G. Cozman. The inferential complexity of Bayesian and credal networks. IJCAI'05, 19th International Joint Conference on Artificial Intelligence, pages 1313-1318, Edinburgh, U.K., 2005.
28. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85, 1999.
29. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
30. E. Fagiuoli and M. Zaffalon. 2U: An exact interval propagation algorithm for polytrees with binary variables. Artificial Intelligence, 106(1):77- 107, 1998.
31. J. S. Ide and F. G. Cozman. IPE and L2U: Approximate algorithms for credal networks. In STAIRS'04, 2nd European Starting AI Researcher Symposium, pages 118-127, Valencia, Spain, 2004.
32. J. S. Ide and F. G. Cozman. Approximate inference in credal networks by variational mean field methods. ISIPTA'05, 4th International Symposium on Imprecise Probabilities and Their Applications, pages 203-212, Pittsburgh, USA, 2005.
33. J. Kohlas and P. P. Shenoy. Computation in valuation algebras. Handbook of Defeasible Reasoning and Uncertainty Management Systems, volume 5: Algorithms for Uncertainty and Defeasible Reasoning, pages 5-39. Kluwer Academic Publishers, Dordrecht, Netherlands, 2000.
34. J. Kohlas and N. Wilson. Exact and approximate local computation in semiring induced valuation algebras. Technical Report 06-06, University of Fribourg, Switzerland, 2006.
35. H. E. Kyburg. Interval-valued probabilities. The Imprecise Probabilities Project. IPP Home Page, available at http://ippserv.rug.ac.be, 1998.
36. I. Levi. The Enterprise of Knowledge. The MIT Press, Cambridge, USA, 1980.
37. J. Pearl. On probability intervals. International Journal of Approximate Reasoning, 2(3):211- 216, 1988.
38. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo, USA, 1988.
39. M. Pouly. Implementation of a generic architecture for local computation. ECAI'04, 16th European Conference on Artificial Intelligence, Workshop 22 on "Local Computation for Logics and Uncertainty", pages 31-37, Valencia, Spain, 2004.
40. M. Pouly. NENOK 1.1 user guide. Technical Report 06-02, Department of Informatics, University of Fribourg, Switzerland, 2006.
41. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2nd edition, 2003.
42. T. Sang, P. Beame, and H. Kautz. Solving Bayesian networks by weighted model counting. In AAAI'05, 20th National Conference on Artificial Intelligence, volume 1, pages 475-482, Pittsburgh, USA, 2005.
43. P. P. Shenoy and G. Shafer. Axioms for probability and belief-function propagation. UAI'88, 4th Conference on Uncertainty in Artificial Intelligence, pages 169-198, Minneapolis, USA, 1988.
44. B. Tessem. Interval probability propagation. International Journal of Approximate Reasoning, 7:95-120, 1992.
45. M. Wachter and R. Haenni. Logical compilation of Bayesian networks. Technical Report iam-06- 006, University of Bern, Switzerland, 2006.
46. M.Wachter and R. Haenni. Propositional DAGs: A new graph-based language for representing Boolean functions. KR'06, 10th International Conference on Principles of Knowledge Representation and Reasoning, pages 277-285, Lake District, U.K., 2006. AAAI Press.
47. M. Wachter and R. Haenni. Multi-state directed acyclic graphs. CanAI'07, 20th Canadian Conference on Artificial Intelligence, LNAI 4509, pages 464-475, Montréal, Canada, 2007.
48. K. Weichselberger. The theory of intervalprobability as a unifying concept for uncertainty. International Journal of Approximate Reasoning, 24(2-3):149-170, 2000.