Recent Developments in Unifying Logic and Probability

被引:48
作者
Russell, Stuart [1 ,2 ]
机构
[1] Univ Calif Berkeley, Comp Sci, Berkeley, CA 94720 USA
[2] Univ Calif Berkeley, Engn, Berkeley, CA 94720 USA
关键词
D O I
10.1145/2699411
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
PERHAPS THE MOST enduring idea from the early days of AI is that of a declarative system reasoning over explicitly represented knowledge with a general inference engine. Such systems require a formal language to describe the real world; and the real world has things in it. For this rea-son, classical AI adopted first-order logic-the mathe-matics of objects and relations-as its foundation. The key benefit of first-order logic is its expressive power, which leads to concise-and hence learnable-models. For example, the rules of chess occupy 10(0) pages in first-order logic, 10(5) pages in propositional logic, and 10(38) pages in the language of finite automata. The power comes from separating predicates from their arguments and quantifying over
引用
收藏
页码:88 / 97
页数:10
相关论文
共 32 条