Number of the records: 1
Complexity of Fuzzy Probability Logics
- 1.0404066 - UIVT-O 20010020 RIV NL eng J - Journal Article
Hájek, Petr - Tulipani, S.
Complexity of Fuzzy Probability Logics.
Fundamenta Informaticae. Roč. 45, č. 3 (2001), s. 207-213. ISSN 0169-2968. E-ISSN 1875-8681
R&D Projects: GA MŠMT LN00A056
Keywords : fuzzy logic * probability * computational complexity
Subject RIV: BA - General Mathematics
The satisfability problem for the logic FP(L) (fuzzy probability logic over Lukasiewicz logic) is shown to be NP-complete; satisfability in FP(LP) (the same over the logic joining Lukasiewicz and product logic) is shown to be in PSPACE.
Permanent Link: http://hdl.handle.net/11104/0124339
Number of the records: 1