Skip to main content
Springer Nature Link
Log in

Probabilistic Logic with Strong Independence

  • Conference paper
Advances in Artificial Intelligence - IBERAMIA-SBIA 2006 (IBERAMIA 2006, SBIA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4140))

  • 950 Accesses

Abstract

This papers investigates the manipulation of statements of strong independence in probabilistic logic. Inference methods based on polynomial programming are presented for strong independence, both for unconditional and conditional cases. We also consider graph-theoretic representations, where each node in a graph is associated with a Boolean variable and edges carry a Markov condition. The resulting model generalizes Bayesian networks, allowing probabilistic assessments and logical constraints to be mixed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Halpern, J.Y.: An analysis of first-order logics of probability. In: International Joint Conference on Artificial Intelligence, Detroit, USA, pp. 1375–1381 (1989)

    Google Scholar 

  2. Halpern, J.Y.: Reasoning about Uncertainty. MIT Press, Cambridge (2003)

    MATH  Google Scholar 

  3. Nerode, A., Shore, R.A.: Logic for applications, 2nd edn. Springer, New York (1997)

    MATH  Google Scholar 

  4. Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.H.: Probabilistic satisfiability. Journal of Complexity 4, 1–11 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hansen, P., Jaumard, B.: Probabilistic satisfiability. Technical report, École Polytechique de Montréal (1996)

    Google Scholar 

  6. Boole, G.: The Laws of Thought. Dover edn. (1958)

    Google Scholar 

  7. Hailperin, T.: Best possible inequalities for the probability of a logical function of events. American Mathematical Monthly 72, 343–359 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nilsson, N.J.: Probabilistic logic. Artificial Intelligence 28, 71–87 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. de Finetti, B.: Theory of Probability, vol. 1-2. Wiley, New York (1974)

    MATH  Google Scholar 

  10. Bruno, G., Gilio, A.: Applicazione del metodo del simplesso al teorema fondamentale per le probabilita nella concezione soggettivistica. Statistica 40, 337–344 (1980)

    MATH  MathSciNet  Google Scholar 

  11. Coletti, G., Scozzafava, R.: Stochastic independence in a coherent setting. Annals of Mathematics and Artificial Intelligence 35, 151–176 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Biazzo, V., Gilio, A., Lukasiewicz, T., Sanfilippo, G.: Probabilistic logic under coherence: Complexity and algorithms. In: International Symposium on Imprecise Probabilities and Their Applications, Shaker, pp. 51–61 (2001)

    Google Scholar 

  13. Andersen, K.A., Hooker, J.N.: Bayesian logic. Decision Support Systems 11, 191–210 (1994)

    Article  Google Scholar 

  14. Coletti, G., Scozzafava, R.: Zero probabilities in stochastic independence. Information, Uncertainty, Fusion, 185–196 (2000)

    Google Scholar 

  15. Vantaggi, B.: Conditional Independence and Graphical Models in a Coherent Setting. PhD thesis, Università di Perugia, Italy (1999)

    Google Scholar 

  16. Lakshmanan, L.V.S., Sadri, F.: Probabilistic deductive databases. In: Symposium on Logic Programming, pp. 254–268 (1994)

    Google Scholar 

  17. Ng, R., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lukasiewicz, T.: Probabilistic logic programming. In: European Conference on Artificial Intelligence, pp. 388–392 (1998)

    Google Scholar 

  19. Bacchus, F.: Representing and Reasoning with Probabilistic Knowledge. MIT Press, Cambridge (1990)

    Google Scholar 

  20. Cozman, F.G.: Calculation of posterior bounds given convex sets of prior probability measures and likelihood functions. Journal of Computational and Graphical Statistics 8(4), 824–838 (1999)

    Article  MathSciNet  Google Scholar 

  21. Couso, I., Moral, S., Walley, P.: A survey of concepts of independence for imprecise probabilities. Risk, Decision and Policy 5, 165–181 (2000)

    Article  Google Scholar 

  22. de Campos, L., Moral, S.: Independence concepts for convex sets of probabilities. In: Conference on Uncertainty in Artificial Intelligence, pp. 108–115. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  23. Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London (1991)

    MATH  Google Scholar 

  24. Drenick, R.F.: Multilinear programming: Duality theories. Journal of Optimization Theory and Applications 72(3), 459–486 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  25. Gochet, W., Smeers, Y.: A branch-and-bound method for reversed geometric programming. Operations Research 27(5), 983–996 (1979)

    Article  MathSciNet  Google Scholar 

  26. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  27. Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Computers and Chemical Engineering 21(4), 351–370 (1997)

    Article  MathSciNet  Google Scholar 

  28. Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  29. Tuy, H.: Convex Analysis and Global Optimization. Nonconvex Optimization and Its Applications, vol. 22. Kluwer Academic Publishers, Dordrecht (1998)

    MATH  Google Scholar 

  30. de Campos, C.P., Cozman, F.G.: The inferential complexity of Bayesian and credal networks. In: International Joint Conference on Artificial Intelligence, pp. 1313–1318 (2005)

    Google Scholar 

  31. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)

    Google Scholar 

  32. Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their AND/OR search space. In: Conference on Uncertainty in Artificial Intelligence, Arlington, Virginia, pp. 120–129. AUAI Press (2004)

    Google Scholar 

  33. Cowell, R., Dawid, P., Lauritzen, S., Spiegelhalter, D.: Probabilistic Networks and Experts Systems. Springer, New York (1999)

    Google Scholar 

  34. de Campos, C.P., Cozman, F.G.: Belief updating and learning in semi-qualitative probabilistic networks. In: Conference on Uncertainty in Artificial Intelligence, pp. 153–160 (2005)

    Google Scholar 

  35. Zhang, N.L., Poole, D.: A simple approach to bayesian network computations. In: Canadian Conference on Artificial Intelligence, pp. 171–178 (1994)

    Google Scholar 

  36. Dechter, R.: Bucket elimination: A unifying framework for probabilistic inference. In: Horvitz, E., Jensen, F. (eds.) Conference on Uncertainty in Artificial Intelligence, pp. 211–219. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  37. de Campos, C.P., Cozman, F.G.: Inference in credal networks using multilinear programming. In: Second Starting AI Researcher Symposium, Valencia, pp. 50–61. IOS Press, Amsterdam (2004)

    Google Scholar 

  38. Cozman, F.G., de Campos, C.P., Ide, J.S., da Rocha, J.C.F.: Propositional and relational Bayesian networks associated with imprecise and qualitative probabilistic assessments. In: Conference on Uncertainty in Artificial Intelligence, Banff, pp. 104–111. AUAI Press (2004)

    Google Scholar 

  39. Cozman, F.G.: Credal networks. Artificial Intelligence 120, 199–233 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  40. da Rocha, J.C.F., Cozman, F.G.: Inference in credal networks with branch-and-bound algorithms. In: International Symposium on Imprecise Probability and Their Applications, Lugano, Switzerland, Carleton Scientific (2003)

    Google Scholar 

  41. da Rocha, J.C.F., Cozman, F.G., de Campos, C.P.: Inference in polytrees with sets of probabilities. In: Conference on Uncertainty in Artificial Intelligence, New York, pp. 217–224. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  42. Ide, J.S., Cozman, F.G.: Approximate inference in credal networks by variational mean field methods. In: International Symposium on Imprecise Probability and Their Applications, pp. 203–212 (2005)

    Google Scholar 

  43. Cozman, F.G., de Campos, C.P.: Local computation in credal networks. In: Workshop on Local Computation for Logics and Uncertainty, Valencia, pp. 5–11. IOS Press, Amsterdam (2004)

    Google Scholar 

  44. Ladkin, P.B., Maddux, R.: On binary constraint problems. Journal of the ACM 41(3), 435–469 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  45. van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. Journal of the ACM 42(3), 543–561 (1995)

    Article  MATH  Google Scholar 

  46. Gettor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of relational structure. In: International Conference on Machine Learning, pp. 170–177 (2001)

    Google Scholar 

  47. Glesner, S., Koller, D.: Constructing flexible dynamic belief networks from first-order probabilistic knowledge bases. Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 217–226 (1995)

    Google Scholar 

  48. Haddawy, P., Suwandi, M.: Decision-theoretic refinement planning using inheritance abstraction. In: AAAI Spring Symposium Series: Decision-Theoretic Planning (1994)

    Google Scholar 

  49. Jaeger, M.: Relational Bayesian networks. In: Conference on Uncertainty in Artificial Intelligence, pp. 266–273. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  50. Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171(1–2), 147–177 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  51. Poole, D.: Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64, 81–129 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Escola Politécnica, Univ. de São Paulo, São Paulo, SP, Brazil

    Fabio G. Cozman & Cassio P. de Campos

  2. Univ. Mackenzie, São Paulo, SP, Brazil

    Cassio P. de Campos

  3. Univ. Estadual de Ponta Grossa, Ponta Grossa, PR, Brazil

    José Carlos F. da Rocha

Authors
  1. Fabio G. Cozman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cassio P. de Campos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José Carlos F. da Rocha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratório de Técnicas Inteligentes (LTI) Escola Politécnica (EP), Universidade de São Paulo (USP),  

    Jaime Simão Sichman

  2. Dep. de Informática, Universidade de Lisboa, Campo Grande, 1749-016, Lisboa, Portugal

    Helder Coelho

  3. Institute of Mathematics and Computer Science, Department of Computer Science, University of São Paulo,, Av. Trabalhador Sao-Carlense, 400, Centro, CP: 668, 13560-970, São Carlos, SP, Brazil

    Solange Oliveira Rezende

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cozman, F.G., de Campos, C.P., da Rocha, J.C.F. (2006). Probabilistic Logic with Strong Independence. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds) Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. IBERAMIA SBIA 2006 2006. Lecture Notes in Computer Science(), vol 4140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874850_65

Download citation

  • DOI: https://doi.org/10.1007/11874850_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45462-5

  • Online ISBN: 978-3-540-45464-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation