The coherence of Łukasiewicz assessments is NP-complete
DOI10.1016/j.ijar.2009.10.002zbMath1201.68117OpenAlexW1998045799MaRDI QIDQ985139
Publication date: 20 July 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2009.10.002
NP-completenessde Finetti's coherence criterioninfinite-valued Łukasiewicz logicprobabilistic Kripke modelsSMV-algebras
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Many-valued logic (03B50)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bookmaking over infinite-valued events
- A logic for reasoning about the probability of fuzzy events
- MV-algebras with internal states and probabilistic fuzzy logics
- Satisfiability in many-valued sentential logic is NP-complete
- Metamathematics of fuzzy logic
- Algebraic foundations of many-valued reasoning
- Averaging the truth-value in Łukasiewicz logic
- De Finetti theorem and Borel states in \([0, 1\)-valued algebraic logic]
- Complexity of fuzzy probability logics. II
- Subreducts of MV-algebras with product and product residuation
- Models for Many-Valued Probabilistic Reasoning
- Algebraic Analysis of Many Valued Logics
- A constructive proof of McNaughton's theorem in infinite-valued logic
- The Uncertain Reasoner's Companion
- A theorem about infinite-valued sentential logic
- Adding structure to MV-algebras
This page was built for publication: The coherence of Łukasiewicz assessments is NP-complete