| 一类树型知识库的更新算法 |
| |
| 引用本文： | 马绍汉,陶雪红.一类树型知识库的更新算法[J].软件学报,1999,10(11):1174-1179. |
| |
| 作者姓名： | 马绍汉 陶雪红 |
| |
| 作者单位： | 山东大学计算机科学系,济南,250100 |
| |
| 基金项目： | 本文研究得到国家自然科学基金和国家863高科技项目基金资助. |
| |
| 摘 要： | 知识库的更新意即向知识库中添加新知识，同时为维护相容性而删除旧知识.已有的知识库更新方法在通常情况下都是难解的.该文从限制问题的结构出发，给出了一种当知识库对应的约束图为树时的多项式时间更新算法.在树型约束图中，算法通过一个自底向上的过程，得到更新后的知识库.
|
| 关 键 词： | 人工智能 知识库更新 算法复杂性 约束图 约束可满足问题 |
| 收稿时间： | 1998/5/12 0:00:00 |
| 修稿时间： | 1998/12/14 0:00:00 |
A Tree-like Knowledge Base Revision Algorithm |
| |
| MA Shao-han and TAO Xue-hong.A Tree-like Knowledge Base Revision Algorithm[J].Journal of Software,1999,10(11):1174-1179. |
| |
| Authors: | MA Shao-han and TAO Xue-hong |
| |
| Abstract: | Knowledge base revision is to add new knowledge into the knowledge base, and to delete old knowledge if it is necessary for preserving consistency. The recently proposed knowledge base revision methods are all intractable in general case. By restricting the structure of the knowledge base, a polynomial revision algorithm is given in this paper when the corresponding constraint graph of the knowledge base is a tree. In the constraint tree, the authors use a bottom-up process to get the revision knowledge base. |
| |
| Keywords: | Artificial intelligence knowledge base revision algorithmic complexity constraint graph constraint satisfiability problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
