中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
a programmable approach to maintenance of a finite knowledge base

文献类型:期刊论文

作者Luan SM ; Dai GZ ; Li W
刊名JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
出版日期2003
卷号18期号:1页码:102-108
关键词knowledge base maintenance propositional logic predicate logic clause set
ISSN号1000-9000
学科主题Computer Science, Hardware & Architecture; Computer Science, Software Engineering
收录类别SCI ; ACM
语种英语
WOS记录号WOS:000180577400013
公开日期2011-07-29
附注In this paper, we present a programmable method of revising a finite clause set. We first present a procedure whose formal parameters are a consistent clause set Gamma and a clause A and whose output is a set of minimal subsets of Gamma which are inconsistent with A. The maximal consistent subsets can be generated from all minimal inconsistent subsets. We develop a prototype system based on the above procedure, and discuss the implementation of knowledge base maintenance. At last, we compare the approach presented in this paper with other related approaches. The main characteristic of the approach is that it can be implemented by a computer program.
源URL[http://124.16.136.157/handle/311060/13180]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Luan SM,Dai GZ,Li W. a programmable approach to maintenance of a finite knowledge base[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2003,18(1):102-108.
APA Luan SM,Dai GZ,&Li W.(2003).a programmable approach to maintenance of a finite knowledge base.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,18(1),102-108.
MLA Luan SM,et al."a programmable approach to maintenance of a finite knowledge base".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 18.1(2003):102-108.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。