Approximations of believability functions under incomplete identification of sets of compatible states

Ivan Kramosil

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Approximations of believability functions under incomplete identification of sets of compatible states”

Statistical approach to proof theory

Ivan Kramosil (1979)

Kybernetika

Similarity:

Possibilistic alternatives of elementary notions and relations of the theory of belief functions

Ivan Kramosil (2001)

Kybernetika

Similarity:

The elementary notions and relations of the so called Dempster–Shafer theory, introducing belief functions as the basic numerical characteristic of uncertainty, are modified to the case when probabilistic measures and basic probability assignments are substituted by possibilistic measures and basic possibilistic assignments. It is shown that there exists a high degree of formal similarity between the probabilistic and the possibilistic approaches including the role of the possibilistic...

$ε$ -admissible simplifications of the dependence structure of a set of random variables

Albert Pérez (1977)

Kybernetika

Similarity:

Displaying similar documents to “Approximations of believability functions under incomplete identification of sets of compatible states”

Statistical approach to proof theory

Possibilistic alternatives of elementary notions and relations of the theory of belief functions

ε -admissible simplifications of the dependence structure of a set of random variables

$ε$ -admissible simplifications of the dependence structure of a set of random variables