On consistency in probabilistic logic for logical formulas represneted by B-hypertrees

One of the problems (mainly unsolved) in probabilistic logic is to consistently assign probabilities to logical formulas. In this paper we consider Horn formulas represented by B-hypertrees. We give a set of necessary conditions that any valid assignment of probabilities to the logical formulas should fulfil. If a certain condition is imposed on the B-hypertree, the necessary conditions are also sufficient, thus describing exactly which rules the assigned probabilities should obey to be consistent.