Complexity of Fuzzy Probability Logics
Copyright policy )Complexity of Fuzzy Probability Logics
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.
Complexity of computation (including implicit computational complexity), product logic, computational complexity, fuzzy probability logic over Łukasiewicz logic, satisfiability problem, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Fuzzy logic; logic of vagueness, NP-complete
Complexity of computation (including implicit computational complexity), product logic, computational complexity, fuzzy probability logic over Łukasiewicz logic, satisfiability problem, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Fuzzy logic; logic of vagueness, NP-complete
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!