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
Relations in GUHA Style Data Mining
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Complexity of fuzzy probability logics II
Fuzzy Sets and Systems
On triangular norms and uninorms definable in Ł Π12
International Journal of Approximate Reasoning
The GUHA method and its meaning for data mining
Journal of Computer and System Sciences
Fuzzy logics with an additional involutive negation
Fuzzy Sets and Systems
A zero-layer based fuzzy probabilistic logic for conditional probability
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| 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.