Proof systems for probabilistic uncertain reasoning
- 1 September 1998
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (3) , 1007-1039
- https://doi.org/10.2307/2586724
Abstract
The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function.Keywords
This publication has 11 references indexed in Scilit:
- A method for updating that justifies minimum cross entropyInternational Journal of Approximate Reasoning, 1992
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.The Journal of Philosophy, 1991
- Probabilities and reasoning about possibilitiesInternational Journal of Approximate Reasoning, 1991
- Statistical Reasoning with Imprecise ProbabilitiesPublished by Springer Nature ,1991
- Nonmonotonic reasoning, preferential models and cumulative logicsArtificial Intelligence, 1990
- A note on the inevitability of maximum entropyInternational Journal of Approximate Reasoning, 1990
- Maximum Entropy and Inductive InferencePublished by Springer Nature ,1989
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Probabilistic logicArtificial Intelligence, 1986
- Theoretical Foundations for Non-Monotonic Reasoning in Expert SystemsPublished by Springer Nature ,1985