Probability expressions (P-Exps) can be used to represent logical functions. This representation has a variety of practical applications in that it provides a computational saving in certain classes of problems. This paper presents some computational aspects of P-exps. Computational complexity and results on the lengths of P-exps are presented. Operations of P-exps such as solution of P-exps and inversion of P-exps to equivalent Boolean expressions are discussed.
|Original language||English (US)|
|Number of pages||3|
|State||Published - Dec 1 1984|
ASJC Scopus subject areas