Probabilistic consistency of knowledge bases in inference systems

In this paper, given an arbitrary finite family of conditional events F, a generalized probabilistic knowledge base represented by a set of conditional probability bounds defined on F is considered. Following the approach of de Finetti we define the concept of coherence for the given set of bounds. Then, some results on the probabilistic consistency of the knowledge base are obtained. Finally, an algorithm to check the coherence of the set of bounds is described and some examples are examined.