2 THESES OF KNOWLEDGE REPRESENTATION - LANGUAGE RESTRICTIONS, TAXONOMIC CLASSIFICATION, AND THE UTILITY OF REPRESENTATION SERVICES

被引:64
作者
DOYLE, J [1 ]
PATIL, RS [1 ]
机构
[1] UNIV SO CALIF,INST INFORMAT SCI,MARINA DEL REY,CA 90292
关键词
D O I
10.1016/0004-3702(91)90029-J
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Levesque and Brachman argue that in order to provide timely and correct responses in the most critical applications, general-purpose knowledge representation systems should restrict their languages by omitting constructs which require nonpolynomial worst-case response times for sound and complete classification. They also separate terminological and assertional knowledge, and restrict classification to purely terminological information. We demonstrate that restricting the terminological language and classifier in these ways limits these "general-purpose" facilities so severely that they are no longer generally applicable. We argue that logical soundness, completeness, and worst-case complexity are inadequate measures for evaluating the utility of representation services, and that this evaluation should employ the broader notions of utility and rationality found in decision theory. We suggest that general-purpose representation services should provide fully expressive languages, classification over relevant contingent information, "approximate" forms of classification involving defaults, and rational management of inference tools.
引用
收藏
页码:261 / 297
页数:37
相关论文
共 44 条
[21]  
MINTON S, 1988, THESIS CARNEGIE MELL
[22]  
MOORE JD, 1986, 1986 NIKL WORKSH
[23]  
MOSER MG, 1983, 5421 BOLT BER NEWM T
[24]   TERMINOLOGICAL REASONING IS INHERENTLY INTRACTABLE [J].
NEBEL, B .
ARTIFICIAL INTELLIGENCE, 1990, 43 (02) :235-249
[25]   COMPUTATIONAL-COMPLEXITY OF TERMINOLOGICAL REASONING IN BACK [J].
NEBEL, B .
ARTIFICIAL INTELLIGENCE, 1988, 34 (03) :371-383
[26]   THE KNOWLEDGE LEVEL [J].
NEWELL, A .
ARTIFICIAL INTELLIGENCE, 1982, 18 (01) :87-127
[27]  
Patel-Schneider P. F., 1987, Computational Intelligence, V3, P64, DOI 10.1111/j.1467-8640.1987.tb00175.x
[28]  
Patel-Schneider P. F., 1984, Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems (Cat. No. 84CH2104-8), P11
[29]   UNDECIDABILITY OF SUBSUMPTION IN NIKL [J].
PATELSCHNEIDER, PF .
ARTIFICIAL INTELLIGENCE, 1989, 39 (02) :263-272
[30]  
PATIL R, 1981, MIT267 LAB COMP SCI