APPLICATIONS OF CIRCUMSCRIPTION TO FORMALIZING COMMONSENSE KNOWLEDGE

被引：422

作者：

MCCARTHY, J

机构：

[1] Stanford Univ, Dep of Computer, Science, Stanford, CA, USA, Stanford Univ, Dep of Computer Science, Stanford, CA, USA

来源：

ARTIFICIAL INTELLIGENCE | 1986年 / 28卷 / 01期

基金：

美国国家科学基金会;

关键词：

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 条

[1]

ETHERINGTON D, 1985, COMPUT INTELL, V1, P11

[2] A DECIDABLE FRAGMENT OF PREDICATE CALCULUS [J].

KETONEN, J ;

WEYHRAUCH, R .

THEORETICAL COMPUTER SCIENCE, 1984, 32 (03) :297-307

[3]

KETONEN J, 1984, EKL INTERACTIVE PROO

[4]

LIFSCHITZ V, 1985, 9TH P INT JOINT C AR

[5] CIRCUMSCRIPTION - A FORM OF NON-MONOTONIC REASONING [J].

MCCARTHY, J .

ARTIFICIAL INTELLIGENCE, 1980, 13 (1-2) :27-39

[6]

MCCARTHY J, 1977, 5TH P INT JOINT C AR

[7]

MCCARTHY J, 1960, P TEDDINGTON C MECHA

[8]

McCarthy J., 1969, MACH INTELL, V4, P473

[9]

MCCARTHY J, 1979, MACHINE INTELLIGENCE, V9

[10]

MCCARTHY J, 1982, TEXTVERARBEITUNG BUR

← 1 2 →