| Full text | |
| Author(s): |
Cozman, Fabio Gagliardi
[1]
Total Authors: 1
|
| Affiliation: | [1] Univ Sao Paulo, Escola Politecn, Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF APPROXIMATE REASONING; v. 131, p. 56-79, APR 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
We examine several concepts of independence associated with (1) credal sets, understood as sets of probability measures, (2) sets of full conditional probabilities, (3) sets of lexicographic probabilities, and (4) sets of desirable gambles. Concepts of independence are evaluated with respect to the graphoid properties they satisfy, as these properties capture important abstract features of ``independence{''}. We emphasize the analysis of sets of probability measures as this is a popular formalism, looking at versions of epistemic, confirmational, and type-5 independence that are based on regular conditioning, as well as complete and strong independence. We then examine analogous concepts of independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles. (C) 2020 Elsevier Inc. All rights reserved. (AU) | |
| FAPESP's process: | 19/07665-4 - Center for Artificial Intelligence |
| Grantee: | Fabio Gagliardi Cozman |
| Support Opportunities: | Research Grants - Research Program in eScience and Data Science - Research Centers in Engineering Program |