an:06172745
Zbl 1274.03041
Ra??kovi??, Miodrag; Ognjanovi??, Zoran; Petrovi??, Vladimir; Majstorovi??, Uro??
An automated theorem prover for the probability logic LPP
EN
Krape??, A. (ed.), A tribute to S. B. Pre??i??. Papers celebrating his 65th birthday. Beograd: Matemati??ki Institut SANU. 79-83 (2001).
2001
a
03B48 03B35 68T15
Summary: We consider a propositional probability logic denoted LPP. LPP is a conservative extension of classical propositional logic. The language of LPP contains probability operators of the form \(P_{\geq s}\) for every real number \(s\in[0,1]\). The intended meaning of a formula of the form \(P_{\geq s}\alpha\) is `\(\alpha\) holds with probability at least \(s\)'. We obtain a decision procedure for LPP by reducing probability formulas to systems of linear equalities and inequalities. We describe an automated theorem prover based on this procedure.
For the entire collection see [Zbl 0977.00051].