Complexity of Fuzzy Probability Logic.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06010020" target="_blank" >RIV/67985807:_____/01:06010020 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity of Fuzzy Probability Logic.
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Fundamenta Informaticae
ISSN
0169-2968
e-ISSN
—
Volume of the periodical
45
Issue of the periodical within the volume
N/A
Country of publishing house
PL - POLAND
Number of pages
7
Pages from-to
207-213
UT code for WoS article
—
EID of the result in the Scopus database
—