From statistical knowledge bases to degrees of belief

被引:106
作者
Bacchus, F
Grove, AJ
Halpern, JY
Koller, D
机构
[1] STANFORD UNIV, DEPT COMP SCI, STANFORD, CA 94305 USA
[2] UNIV WATERLOO, DEPT COMP SCI, WATERLOO, ON N2L 3G1, CANADA
[3] NEC RES INST, PRINCETON, NJ 08540 USA
[4] IBM CORP, ALMADEN RES CTR, SAN JOSE, CA 95120 USA
关键词
D O I
10.1016/S0004-3702(96)00003-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. For example, if the agent wishes to employ the expected-utility paradigm of decision theory to guide its actions, it will need to assign degrees of belief (subjective probabilities) to various assertions. Of course, these degrees of belief should not be arbitrary, but rather should be based on the information available to the agent. This paper describes one approach for inducing degrees of belief from very rich knowledge bases, that can include information about particular individuals, statistical correlations, physical laws, and default rules. We call our approach the random-worlds method. The method is based on the principle of indifference: it treats all of the worlds the agent considers possible as being equally likely. It is able to integrate qualitative default reasoning with quantitative probabilistic reasoning by providing a language in which both types of information can be easily expressed. Our results show that a number of desiderata that arise in direct inference (reasoning from statistical information to conclusions about individuals) and default reasoning follow directly from the semantics of random worlds. For example, random worlds captures important patterns of reasoning such as specificity, inheritance, indifference to irrelevant information, and default assumptions of independence. Furthermore, the expressive power of the language used and the intuitive semantics of random worlds allow the method to deal with problems that are beyond the scope of many other nondeductive reasoning systems.
引用
收藏
页码:75 / 143
页数:69
相关论文
共 74 条
[1]  
Adams ErnestW., 1975, LOGIC CONDITIONALS A
[2]  
[Anonymous], LECT NOTES COMPUTER
[3]  
ASHER N, 1993, P IJCAI WORKSH COND, P26
[4]  
BACCHUS F, 1994, PROCEEDINGS OF THE TWELFTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P222
[5]  
BACCHUS F, 1993, P INT JOINT C ART IN, P563
[6]  
Bacchus F., 1994, P 10 ANN C UNC ART I, P37
[7]  
BACCHUS F, 1992, P 10 NAT C ART INT A, P602
[8]  
BACCHUS F, 1994, COMPUT INTELL, V10, P21
[9]  
BACCHUS F, 1990, REPRESENTING REASONI
[10]  
BOUTILIER C, 1991, THESIS U TORONTO TOR