 In this subsection, we consider a first-order probability logic with a possible-world semantics (which we abbreviate FOPL). The language of FOPL is similar to the example we gave in  Section 5.1  related to that of Bacchus, except here we have full quantifier formulas of the form \((\forall x)\phi\) for any formula \(\phi\), and instead of probability formulas of the form \(Px(\phi)\ge q\), we have probability formulas of the form \(P(\phi)\ge q\) (similar to the probability formulas in propositional probability logic).