We characterize (in terms of necessary and sufficient conditions) binary relations representable by a lower probability. Such relations can be non-additive (as the relations representable by a probability) and also not "partially monotone" (as the relations representable by a belief function). Moreover we characterize relations representable by upper probabilities and those representable by plausibility. In fact the conditions characterizing these relations are not immediately deducible by means of "dual" conditions given on the contrary events, like in the numerical case.

Non additive ordinal relations representable by conditional probabilities and its use in expert systems

CAPOTORTI, Andrea;COLETTI, Giulianella;
1998

Abstract

We characterize (in terms of necessary and sufficient conditions) binary relations representable by a lower probability. Such relations can be non-additive (as the relations representable by a probability) and also not "partially monotone" (as the relations representable by a belief function). Moreover we characterize relations representable by upper probabilities and those representable by plausibility. In fact the conditions characterizing these relations are not immediately deducible by means of "dual" conditions given on the contrary events, like in the numerical case.
1998
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/103307
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 13
social impact