Cox's theorem revisited

被引：24

作者：

Halpern, JY ^{[1
]}

机构：

[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA

来源：

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH | 1999年 / 11卷

关键词：

D O I：

10.1613/jair.644

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.

引用

页码：429 / 435

页数：7

共 9 条

[1]

ACZEL J, 1975, MEASURES INFORMATION

[2] PROBABILITY, FREQUENCY AND REASONABLE EXPECTATION [J].

COX, RT .

AMERICAN JOURNAL OF PHYSICS, 1946, 14 (01) :1-13

[3]

COX RT, 1978, MAXIMUM ENTROPY FORM, P119

[4]

Dubois D., 1990, International Journal of Approximate Reasoning, V4, P1, DOI 10.1016/0888-613X(90)90006-N

[5]

Halpern J., 1999, J AI RES, V10, P76

[6]

JAYNES ET, 1996, UNPUB PROBABILITY TH

[7]

Paris J.B., 1994, The Uncertain Reasoner's Companion-A Mathematical Perspective

[8]

Savage Leonard J., 1954, Foundations of Statistics

[9] On the correctness and reasonableness of Cox's Theorem for finite domains [J].

Snow, P .

COMPUTATIONAL INTELLIGENCE, 1998, 14 (03) :452-459

← 1 →