The coherence of Łukasiewicz assessments is NP-complete

DOI10.1016/J.IJAR.2009.10.002MaRDI QIDQ985139zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

NP-completenessde Finetti's coherence criterionprobabilistic Kripke modelsSMV-algebrasinfinite-valued Łukasiewicz logic

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3514748 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 566410 (Why is no real title available?)
• scientific article; zbMATH DE number 960150 (Why is no real title available?)
• A constructive proof of McNaughton's theorem in infinite-valued logic
• A logic for reasoning about the probability of fuzzy events
• A theorem about infinite-valued sentential logic
• Adding structure to MV-algebras
• Algebraic Analysis of Many Valued Logics
• Algebraic foundations of many-valued reasoning
• Averaging the truth-value in Łukasiewicz logic
• Bookmaking over infinite-valued events
• Complexity of fuzzy probability logics. II
• De Finetti theorem and Borel states in \([0, 1]\)-valued algebraic logic
• MV-algebras with internal states and probabilistic fuzzy logics
• Metamathematics of fuzzy logic
• Models for Many-Valued Probabilistic Reasoning
• Satisfiability in many-valued sentential logic is NP-complete
• Subreducts of MV-algebras with product and product residuation
• The Uncertain Reasoner's Companion

Cited in

(14)

• Computational complexity of infinite-valued Łukasiewicz propositional logic
• Non-reversible betting games on fuzzy events: complexity and algebra
• An algebraic treatment of imprecise probabilities
• 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
• The complexity of 3-valued Łukasiewicz rules
• Quantitative logic reasoning
• States in Łukasiewicz logic correspond to probabilities of rational polyhedra
• Strict coherence on many-valued events
• Unimodular triangulations in Łukasiewicz logic: complexity bounds of probabilistic coherence
• Non-standard probability, coherence and conditional probability on many-valued events
• Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic

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)