The coherence of Łukasiewicz assessments is NP-complete
DOI10.1016/J.IJAR.2009.10.002zbMATH Open1201.68117OpenAlexW1998045799MaRDI QIDQ985139FDOQ985139
Authors: Simone Bova, Tommaso Flaminio 
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
Recommendations
- Computational complexity of infinite-valued Łukasiewicz propositional logic
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Complexity of fuzzy probability logics
- Computational aspects of probability logics
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
NP-completenessde Finetti's coherence criterionprobabilistic Kripke modelsSMV-algebrasinfinite-valued Łukasiewicz logic
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)
Cites Work
- Title not available (Why is that?)
- Metamathematics of fuzzy logic
- Algebraic foundations of many-valued reasoning
- Algebraic Analysis of Many Valued Logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Satisfiability in many-valued sentential logic is NP-complete
- Averaging the truth-value in Łukasiewicz logic
- De Finetti theorem and Borel states in \([0, 1]\)-valued algebraic logic
- Title not available (Why is that?)
- The Uncertain Reasoner's Companion
- A theorem about infinite-valued sentential logic
- MV-algebras with internal states and probabilistic fuzzy logics
- Subreducts of MV-algebras with product and product residuation
- Models for Many-Valued Probabilistic Reasoning
- Adding structure to MV-algebras
- Bookmaking over infinite-valued events
- A logic for reasoning about the probability of fuzzy events
- Complexity of fuzzy probability logics. II
- A constructive proof of McNaughton's theorem in infinite-valued logic
Cited In (11)
- Computational complexity of infinite-valued Łukasiewicz propositional logic
- Non-reversible betting games on fuzzy events: complexity and algebra
- An algebraic treatment of imprecise probabilities
- STRICT COHERENCE ON MANY-VALUED EVENTS
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Franco Montagna's work on provability logic and many-valued logic
- Rota's Fubini lectures: the first problem
- On the Complexity of Non-reversible Betting Games on Many-Valued Events
- States in Łukasiewicz logic correspond to probabilities of rational polyhedra
- Non-standard probability, coherence and conditional probability on many-valued events
- Quantitative Logic Reasoning
This page was built for publication: The coherence of Łukasiewicz assessments is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985139)
