Coherence checking and propagation of lower probability bounds

 In this paper we use imprecise probabilities, based on a concept of generalized coherence (g-coherence), for the management of uncertain knowledge and vague information. We face the problem of reducing the computational difficulties in g-coherence checking and propagation of lower conditional probability bounds. We examine a procedure, based on linear systems with a reduced number of unknowns, for the checking of g-coherence. We propose an iterative algorithm to determine the reduced linear systems. Based on the same ideas, we give an algorithm for the propagation of lower probability bounds. We also give some theoretical results that allow, by suitably modifying our algorithms, the g-coherence checking and propagation by working with a reduced set of variables and/or with a reduced set of constraints. Finally, we apply our algorithms to some examples.

Authors and Affiliations

1. Dip. di Metodi e Modelli Matematici, Via A. Scarpa, 16 - 00161 Roma, Italy e-mail: gilio@dmmm.uniroma1.it, , , , , , IT

   A. Gilio

2. Dipartimento di Matematica e Informatica, Viale A. Doria, 6 - 95125 Catania, Italy, , , , , , IT

   V. Biazzo & G. Sanfilippo

RID="*"

ID="*" This paper is a revised and substantially extended version of a previous paper by the same authors, appeared in the Proc. of the 5th Workshop on Uncertainty Processing (WUPES'2000), Jindřichu̇v Hradec, Czech Republic, June 21–24, 1–13, 2000.

Reprints and permissions