Journal of Software:1999.10(11):1174-1179

A Tree-like Knowledge Base Revision Algorithm
MA Shao-han,TAO Xue-hong
Chart / table
Similar Articles
Article :Browse 2821   Download 2428
Received:May 12, 1998    Revised:December 14, 1998
> 中文摘要: 知识库的更新意即向知识库中添加新知识,同时为维护相容性而删除旧知识.已有的知识库更新方法在通常情况下都是难解的.该文从限制问题的结构出发,给出了一种当知识库对应的约束图为树时的多项式时间更新算法.在树型约束图中,算法通过一个自底向上的过程,得到更新后的知识库.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家自然科学基金和国家863高科技项目基金资助. 本文研究得到国家自然科学基金和国家863高科技项目基金资助.
Foundation items:
Reference text:


MA Shao-han,TAO Xue-hong.A Tree-like Knowledge Base Revision Algorithm.Journal of Software,1999,10(11):1174-1179