scientific article
From MaRDI portal
Publication:2711325
zbMath0972.03025MaRDI QIDQ2711325
Publication date: 13 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitysatisfiability problemNP-completeproduct logicfuzzy probability logic over Łukasiewicz logic
Fuzzy logic; logic of vagueness (03B52) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Possibilistic conditioning framed in fuzzy logics ⋮ NP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach ⋮ Two-layered logics for paraconsistent probabilities ⋮ Introduction ⋮ Complexity of fuzzy probability logics. II ⋮ A logical and algebraic treatment of conditional probability ⋮ Fuzzy sets and formal logics ⋮ Fuzzy logics with an additional involutive negation ⋮ On triangular norms and uninorms definable in Ł\(\Pi \frac{1}{2}\) ⋮ The GUHA method and its meaning for data mining
This page was built for publication:
