Simplification rules for the coherent probability assessment problem
From MaRDI portal
Publication:1601897
DOI10.1023/A:1014585822798zbMATH Open1006.68128MaRDI QIDQ1601897FDOQ1601897
Barbara Vantaggi, Sauro Tulipani, Marco Baioletti, Andrea Capotorti
Publication date: 27 June 2002
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Cited In (16)
- Inferential processes leading to possibility and necessity
- Inferential models and relevant algorithms in a possibilistic framework
- Probabilistic entailment in the setting of coherence: the role of quasi conjunction and inclusion relation
- T-Absolute Truth Degree Theory of Formulas in Three-Valued Łukasiewicz Propositional Logic System
- Randomization of classical inference patterns and its application
- Generalized Bayesian inference in a fuzzy context: from theory to a virtual reality application
- Possibilistic and Probabilistic Logic under Coherence: Default Reasoning and System P
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- 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
- A Propositional CONEstrip Algorithm
- 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)
