LOGIC PROGRAMMING AND KNOWLEDGE REPRESENTATION

被引:181
作者
BARAL, C [1 ]
GELFOND, M [1 ]
机构
[1] UNIV TEXAS, DEPT COMP SCI, EL PASO, TX 79968 USA
来源
JOURNAL OF LOGIC PROGRAMMING | 1994年 / 20卷
关键词
D O I
10.1016/0743-1066(94)90025-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language. We also discuss extensions of logic programming allowing abductive reasoning, meta-reasoning and reasoning in open domains. We investigate the methodology of using these languages for representing various forms of nonmonotonic reasoning and for describing knowledge in specific domains. We also address recent work on properties of programs needed for sucessful applications of this methodology such as consistency, categoricity and complexity.
引用
收藏
页码:73 / 148
页数:76
相关论文
共 244 条
[81]  
GELFOND M, 1993, WORKSHOP LOGIC PROGR
[82]  
GELFOND M, 1986, P ACM SIGACT SIGMOND, P133
[83]  
GELFOND M, 1993, STRATIFICATION EXTEN
[84]  
GELFOND M, 1991, TR912 U TEX TECHN RE
[85]  
GELFOND M, 1993, 2ND P INT WORKSH LOG, P397
[86]  
GELFOND M, 1989, LECTURE NOTES ARTIFI, V346, P176
[87]  
Gelfond M., 1992, P JOINT INT C S LOG, P559
[88]  
GELFOND M, 1991, 2ND P INT C PRINC KN, P230
[89]  
GELFOND M, 1987, P AAAI 87, P207
[90]  
GELFOND M, 1992, ANN MATH ARTIFICIAL