An analysis of first-order logics of probability

作者: Joseph Y. Halpern

DOI:

关键词:

摘要: … a formula to be closed if no variables in the formula are free. Just as for first-order logic, we can show that the truth of a formula … In particular, it follows that the truth of a closed formula is …

参考文章(11)
Joseph Y. Halpern, Ronald Fagin, Uncertainty, belief, and probability international joint conference on artificial intelligence. pp. 1161- 1167 ,(1989)
Joseph Y. Halpern, Ronald Fagin, Reasoning about Knowledge and Probability theoretical aspects of rationality and knowledge. pp. 277- 293 ,(1988)
K. J. Evans, Representing and Reasoning with Probabilistic Knowledge Journal of the Operational Research Society. ,vol. 43, pp. 926- 926 ,(1993) , 10.1057/JORS.1992.139
Ronald R. Yager, Vladik Kreinovich, Higher order probability and intervals International Journal of Approximate Reasoning. ,vol. 2, pp. 195- 215 ,(1988) , 10.1016/S0888-613X(99)00028-6
M. Abadi, J.Y. Halpern, Decidability and expressiveness for first-order logics of probability foundations of computer science. pp. 148- 153 ,(1989) , 10.1109/SFCS.1989.63470
Henry E. Kyburg, Higher order probabilities and intervals International Journal of Approximate Reasoning. ,vol. 2, pp. 195- 209 ,(1988) , 10.1016/0888-613X(88)90116-8
Fahiem Bacchus, On probability distributions over possible worlds uncertainty in artificial intelligence. ,vol. 9, pp. 217- 226 ,(1990) , 10.1016/B978-0-444-88650-7.50022-6
Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo, A logic for reasoning about probabilities logic in computer science. ,vol. 87, pp. 78- 128 ,(1988) , 10.1016/0890-5401(90)90060-U
Nils J. Nilsson, Probabilistic logic Artificial Intelligence archive. ,vol. 28, pp. 71- ,(1986) , 10.1016/0004-3702(86)90031-7