APPLICATIONS OF CIRCUMSCRIPTION TO FORMALIZING COMMONSENSE KNOWLEDGE

被引:418
作者
MCCARTHY, J
机构
[1] Stanford Univ, Dep of Computer, Science, Stanford, CA, USA, Stanford Univ, Dep of Computer Science, Stanford, CA, USA
基金
美国国家科学基金会;
关键词
D O I
10.1016/0004-3702(86)90032-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new and more symmetric version of the circumscription method of non-monotonic reasoning first described by J. McCarthy and some applications to formalizing common-sense knowledge. The applications in this paper are monthly based on minimizing the abnormality of different aspects of various entities. Included are non-monotonic treatments of 'is-a' hierarchies, the unique names hypothesis, and the frame problem. The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more general formalism called prioritized circumscription is briefly explored
引用
收藏
页码:89 / 116
页数:28
相关论文
共 13 条