Complexity of Fuzzy Probability Logics

The satisfiability problem for the logic FP(L) (fuzzy probability logic over Lukasiewicz logic) is shown to be NP-complete; satisfiability in FP(LΠ) (the same over the logic joining Lukasiewicz and product logic) is shown to be in PSPACE.

[1]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[2]  Christos H. Papadimitriou,et al.  Probabilistic satisfiability , 1988, J. Complex..

[3]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[4]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[5]  Jane M. Booker,et al.  Fuzzy Logic and Probability Applications , 2002, Fuzzy Logic and Probability Applications.