Simplification rules for the coherent probability assessment problem
From MaRDI portal
Cited in
(16)- Inferential processes leading to possibility and necessity
- Inferential models and relevant algorithms in a possibilistic framework
- Possibilistic and probabilistic logic under coherence: default reasoning and system P
- A propositional CONEstrip algorithm
- Probabilistic entailment in the setting of coherence: the role of quasi conjunction and inclusion relation
- Randomization of classical inference patterns and its application
- Generalized Bayesian inference in a fuzzy context: from theory to a virtual reality application
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- T-absolute truth degree theory of formulas in three-valued Łukasiewicz propositional logic system
- Benefits of embedding structural constraints in coherent diagnostic processes
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Interpretation of De Finetti coherence criterion in Łukasiewicz logic
- Optimization and probabilistic satisfiability on nested and co-nested formulas
- Faithful and Invariant Conditional Probability in Łukasiewicz Logic
- Probabilistic satisfiability and coherence checking through integer programming
- Probability logic and optimization SAT: The PSAT and CPA models
This page was built for publication: Simplification rules for the coherent probability assessment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601897)
