Journal of Complexity
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Complexity of many-valued logics
Beyond two
Mixed Rational Assessments of Possibility and Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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.