UNDECIDABILITY OF SUBSUMPTION IN NIKL

被引：24

作者：

PATELSCHNEIDER, PF

机构：

来源：

关键词：

D O I：

10.1016/0004-3702(89)90030-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：263 / 272

页数：10

共 17 条

[1] AN OVERVIEW OF THE KL-ONE KNOWLEDGE REPRESENTATION SYSTEM [J].

BRACHMAN, RJ ;

SCHMOLZE, JG .

[2]

*INT JOINT COMM AR, 1985, P IJCAI 85

[3]

Kaczmarek T. S., 1986, Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, P978

[4]

Levesque H. J., 1987, Computational Intelligence, V3, P78, DOI 10.1111/j.1467-8640.1987.tb00176.x

[5]

Lewis H.R, 1979, UNSOLVABLE CLASSES Q

[6]

LIPKIS T, 1982, 1981 P KL ONE WORKSH, P126

[7]

MACGREGOR R, 1987, ISIRS87188 U SO CAL

[8]

MACGREGOR RM, 1988, P AAAI 88 ST PAUL

[9] COMPUTATIONAL-COMPLEXITY OF TERMINOLOGICAL REASONING IN BACK [J].

NEBEL, B .

[10]

NEBEL B, 1988, METHODOLOGIES INTELL, V3, P260