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.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/