Complexity of Fuzzy Probability Logics

and

https://doi.org/10.3233/FUN-2001-45304

Abstract

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.

Keywords

fuzzy logic probability computational complexity

Get full access to this article

View all access options for this article.