Complexity of fuzzy probability logics

MaRDI QIDQ2711325zbMATH OpenFDO

Authors Petr Hájek, Sauro Tulipani

Publication date 13 November 2001

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

computational complexityfuzzy probability logic over Łukasiewicz logicNP-completeproduct logicsatisfiability problem

Mathematics Subject Classification ID

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)

Recommendations

• Complexity of fuzzy probability logics. II
• scientific article; zbMATH DE number 6276275
• Some Complexity Results on Fuzzy Description Logics
• scientific article; zbMATH DE number 6276276
• A logic for reasoning about the probability of fuzzy events
• Arithmetical complexity of fuzzy predicate logics -- a survey
• Three complexity problems in quantified fuzzy logic
• Complexity of some language fragments of fuzzy logics
• Complexity for probability logic with quantifiers over propositions
• On fuzzification of propositional logics

Cited in

(24)

• The GUHA method and its meaning for data mining
• Inferences in probability logic
• Fuzzy refutations for probability and multivalued logics
• The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm
• A logical and algebraic treatment of conditional probability
• Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
• Fuzzy sets and formal logics
• Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
• Fuzzy logics with an additional involutive negation
• On triangular norms and uninorms definable in Ł\(\Pi \frac{1}{2}\)
• Complexity of fuzzy probability logics. II
• Some Complexity Results on Fuzzy Description Logics
• Non-Archimedean fuzzy and probability logic
• Complexity of fuzzy answer set programming under Łukasiewicz semantics
• Complexity and Definability Issues in LFormula
• Introduction
• Fuzzy Positive Primitive Formulas
• Two-layered logics for paraconsistent probabilities
• Reasoning with belief functions over Belnap-Dunn logic
• Two-layered logics for probabilities and belief functions over Belnap-Dunn logic
• Possibilistic conditioning framed in fuzzy logics
• A logic for reasoning about the probability of fuzzy events
• NP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach
• The coherence of Łukasiewicz assessments is NP-complete

This page was built for publication: Complexity of fuzzy probability logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711325)