Skip to main content
SpringerLink
Log in
Book cover

European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

ECSQARU 1993: Symbolic and Quantitative Approaches to Reasoning and Uncertainty pp 341–348Cite as

Formal properties of conditional independence in different calculi of AI

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 747))

Abstract

In this paper formal properties of CI in different frameworks are studied. The first part is devoted to the comparison of three different frameworks for study CI: probability theory, theory of relational databases and Spohn's theory of ordinal conditional functions. Although CI-models arising in these frameworks are very similar (they satisfy semigraphoid axioms) we give examples showing that their formal properties still differ (each other). On the other hand, we find that (within each of these frameworks) there exists no finite complete axiomatic characterization of CI-models by finding an infinite set of sound inference rules (the same in all three frameworks). In the second part further frameworks for CI are discussed: Dempster-Shafer theory, possibility theory and (general) Shenoy's theory of valuation-based systems.

This research was supported by the internal grant n.275105 of the Academy of Sciences of Czech Republic ”Conditional independence properties in uncertainty processing”.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.M. de Campos, J.F. Huete: Independence concepts in upper and lower probabilities. In: Proceedings of IPMU'92 (inter. conf. on Information Processing and Management of Uncertainty in knowledge-based systems, Mallorca, July 6–10, 1992), 129–132

    Google Scholar 

  2. A.P. Dawid: Conditional independence in statistical theory. Journal of the Royal Statistical Society B 41, 1–31 (1979)

    Google Scholar 

  3. M. Goldszmidt, J. Pearl: Rank-based systems: a simple approach to belief revision, belief update, and reasoning about evidence and actions. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, October 1992, 661–672

    Google Scholar 

  4. D. Hunter: Graphoids and natural conditional functions. International Journal of Approximate Reasoning 5, 489–504 (1991)

    Google Scholar 

  5. G.J. Klir, T.A.Folger: Fuzzy Sets, Uncertainty and Information. Prentice Hall. Englewood Cliffs, N.J. 1988

    Google Scholar 

  6. J. Pearl: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman. San Máteo, California 1988

    Google Scholar 

  7. Y. Sagiv, S.F. Walecka: Subset dependencies and completeness result for a subclass of embedded multivalued dependencies. Journal of the Association for Computing Machinery 29, 103–117 (1982)

    Google Scholar 

  8. G. Shafer, P.P. Shenoy, K. Mellouli: Propagating belief functions in qualitative Markov trees. International Journal of Approximate Reasoning 1, 349–400 (1987)

    Google Scholar 

  9. P.P. Shenoy: On Spohn's rule for revision of beliefs. International Journal of Approximate Reasoning 5, 149–181 (1991)

    Google Scholar 

  10. P.P. Shenoy: Conditional independence in valuation-based systems. School of Business working paper n. 236, University of Kansas, Lawrence 1992, submitted to Annals of Statistics

    Google Scholar 

  11. W. Spohn: Stochastic independence, causal independence and shieldability. Journal of Philosophical Logic 9, 73–99 (1980)

    Google Scholar 

  12. W. Spohn: Ordinal conditional functions: a dynamic theory of epistemic states. In: W.L. Harper, B. Skyrms (eds.): Causation in Decision, Belief Change, and Statistics, vol. II. Kluwer Academic Publishers. Dordrecht 1988, 105–134

    Google Scholar 

  13. W. Spohn: On the properties of conditional independence, to appear in P. Humphreys (eds.): Patrick Suppes — Mathematical Philosopher. Synthese 1993

    Google Scholar 

  14. M. Studený: Multiinformation and the problem of characterization of conditional independence relations. Problems of Control and Information Theory 18, 3–16 (1989)

    Google Scholar 

  15. M.Studený: Conditional independence relations have no finite complete characterization. In: Transactions of 11-th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes vol.B. Academia. Prague 1992, 377–396

    Google Scholar 

  16. M. Studený: Conditional independence and natural conditional functions, submitted to International Journal of Approximate Reasoning

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Theory and Automation, Academy of Sciences of Czech Republic, Pod vodárenskou věží 4, 18208, Prague 8, Czech Republic

    Milan Studený

Authors
  1. Milan Studený
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Clarke Rudolf Kruse Serafín Moral

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Studený, M. (1993). Formal properties of conditional independence in different calculi of AI. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028219

Download citation

  • DOI: https://doi.org/10.1007/BFb0028219

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57395-1

  • Online ISBN: 978-3-540-48130-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation