Simplification rules for the coherent probability assessment problem

DOI10.1023/A:1014585822798zbMath1006.68128MaRDI QIDQ1601897

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)

zbMATH Keywords

probabilistic satisfiabilitycoherent probability assessment

Mathematics Subject Classification ID

Foundations of probability theory (60A99) Mechanization of proofs and logical operations (03B35)

Related Items

Possibilistic and Probabilistic Logic under Coherence: Default Reasoning and System P, Benefits of embedding structural constraints in coherent diagnostic processes, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Generalized Bayesian inference in a fuzzy context: from theory to a virtual reality application, Probabilistic entailment in the setting of coherence: the role of quasi conjunction and inclusion relation, Optimization and probabilistic satisfiability on nested and co-nested formulas, Inferential processes leading to possibility and necessity, Randomization of classical inference patterns and its application, Inferential models and relevant algorithms in a possibilistic framework, Probability logic and optimization SAT: The PSAT and CPA models, Faithful and Invariant Conditional Probability in Łukasiewicz Logic, T-Absolute Truth Degree Theory of Formulas in Three-Valued Łukasiewicz Propositional Logic System, A Propositional CONEstrip Algorithm, Interpretation of De Finetti coherence criterion in Łukasiewicz logic, Probabilistic satisfiability and coherence checking through integer programming, A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments