Epistemic irrelevance on sets of desirable gambles

Annals of Mathematics and Artificial Intelligence

Volumn 45, Issue 1-2, 2005, Pages 197-214

  Moral, Serafín ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

Conditioning; Desirable gambles; Epistemic independence; Epistemic irrelevance; Imprecise probabilities

Indexed keywords

EID: 32544453968     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-9011-0     Document Type: Article

References (17)

1. I. Couso, S. Moral and P. Walley, A survey of concepts of independence for imprecise probabilities, Risk, Decision and Policy 5 (2000) 165-181.
2. F. Cozman, Credal networks, Artificial Intelligence 120 (2000) 199-233.
3. F. Cozman and P. Walley, Graphoid properties of epistemic irrelevance and independence, in: Proceedings of the Second International Symposium on Imprecise Probabilities and Their Applications (ISIPTA '01), eds. G. de Cooman, T. Fine and T. Seidenfeld (Shaker Publishing, 2001) pp. 112-121.
4. A. Dawid, Conditional independence, in: Encyclopedia of Statistical Sciences, Update Vol. 2, eds. S. Kotz, C.B. Read and D.L. Banks (Wiley, New York, 1999) pp. 146-153.
5. S. Moral, Epistemic irrelevance on sets of desirable gambles, in: Proceedings of the Second International Symposium on Imprecise Probabilities and Their Applications, eds. G. de Cooman, T. Fine, and T. Seidenfeld (Shaker Publishing, 2001) pp. 247-254.
6. S. Moral and A. Cano, Strong Conditional Independence for Credal Sets, Annals of Mathematics and Artificial Intelligence 35 (2002) 295-321.
7. S. Moral and N. Wilson, Revision rules for convex sets of probabilities, in: Mathematical Models for Handling Partial Knowledge in Artificial Intelligence, eds. G. Coletti, D. Dubois and R. Scozzafava (Plenum Press, 1995) pp. 113-128.
8. J. Pearl, Probabilistic Reasoning with Intelligent Systems (Morgan & Kaufman, San Mateo, 1988).
9. J. Pearl and T. Verma, The logic of representing dependencies by directed graphs, in: Proceedings of the AAAI'87 Conference (AAAI/MIT Press, 1987) pp. 347-379.
10. G. Shafer and P. Shenoy, Local Computation in Hypertrees, Working Paper N. 201, School of Business, University of Kansas, Lawrence, 1988.
11. M. Studeny, On separation criterion and recovery algorithm for chain graphs, in: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI-96) (Portland, Oregon, 1996) pp. 509-516.
12. M. Studeny, Semigraphoids and structures of probabilistic conditional independence, Annals of Mathematics and Artificial Intelligence 21 (1997) 71-98.
13. B. Vantaggi, Graphical models for conditional independence structures, in: Proceedings of the Second International Symposium on Imprecise Probabilities and Their Applications, eds. G. de Cooman, T. Fine and T. Seidenfeld (Shaker Publishing, 2001) pp. 332-341.
14. P. Vicig, Epistemic independence for imprecise probabilities, International Journal of Approximate Reasoning 24 (2000) 235-250.
15. P. Walley, Statistical Reasoning with Imprecise Probabilities (Chapman and Hall, London, 1991).
16. P. Walley, Towards a unified theory of imprecise probability, International Journal of Approximate Reasoning 24 (2000) 125-148.
17. N. Wilson and S. Moral, A logical view of probability, in: Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI'94), ed. A. Cohn (Wiley, London, 1994) pp. 386-390.