Complexity of Fuzzy Probability Logics
Petr Hájek, Sauro Tulipani · Fundamenta Informaticae · 2001
The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.